We continue here the investigation of the relationship between the intersection of a pair of subgroups of a Kleinian group, and in particular the limit set of that intersection, and the intersection of the limit sets of the subgroups. Of specific interest is the extent to which the intersection of the limit sets being …
Max arcs on spheres intersecting twice, proven.
problem Maximizing arcs on spheres with intersection constraints.
method Proved maximal cardinality of arcs intersecting at most twice.
result Maximal cardinality of arcs intersecting at most twice is |X|(|X| + 1)(|X| + 2).
We prove that on a punctured oriented surface with Euler characteristic chi < 0, the maximal cardinality of a set of essential simple arcs that are pairwise non-homotopic and intersecting at most once is 2|chi|(|chi|+1). This gives a cubic estimate in |chi| for a set of curves pairwise intersecting at most once on a cl…
Study on shortest geodesics with self-intersections on hyperbolic surfaces.
problem Finding shortest closed geodesics with a fixed number of self-intersections.
method Investigated minimal length geodesics with at least k self-intersections, proving upper bounds and asymptotic behavior. result Self-intersection numbers are bounded by a linear function of k for any hyperbolic surface, and asymptotically like k in the presence of cusps. Extended Birman-Series result to geodesics with infinitely many self-intersections.
problem Classifying geodesics with infinitely many self-intersections on hyperbolic surfaces.
method Defined a self-intersection function and extended the Birman-Series result to sets with bounded self-intersection functions.
result Same conclusion as Birman-Series for geodesics with self-intersection functions in o(l2). The paper extends the avoidance principle for mean curvature flows, proving new intersection dimension monotonicity results.
problem Understanding the behavior of intersections in mean curvature flows.
method Proving new intersection dimension monotonicity results for mean curvature flows, Brakke flows, and level set flows.
result The dimension of the intersection of mean curvature flows is non-increasing over time.
Sharp lower bound on fold singularities self-intersections.
problem Finding a lower bound on the number of self-intersections of fold singularities.
method Established a sharp lower bound on the number of self-intersections of the boundary of an immersed surface, then applied this to fold singularities.
result Sharp lower bound on the number of self-intersections of fold singularities.
Generalizes intersection product for PL pseudomanifolds, proving duality.
problem Proving duality between intersection homology and cohomology products.
method Generalizes intersection product for PL pseudomanifolds, sheafifies the product, and corrects a proof of Poincaré duality.
result Establishes duality between intersection homology and cohomology products.
A method to compute intersection numbers with matrices of positive corank.
problem Computing the intersection number of maps with matrices of positive corank.
method Extending intersection number definition to stratified sets, using homotopy invariants and Stiefel manifolds.
result An effective method to compute the intersection number in polynomial cases.
Study on symmetry defects of complete intersections in complex space.
problem Characterizing symmetry defects of complete intersections.
method Analyzing midpoints of chords connecting points in complete intersections.
result Symmetry defect of complete intersections is an algebraic variety.
Study properties of self-similar continua with finite intersection property.
problem Characterize self-similar continua with finite intersection property.
method Prove intersection graph criterion, finite order theorem, and parameter matching theorem.
result All Jordan arcs starting from a intersection point in such continuum on a plane should have the same slope parameter at that point.
New theorems link graph properties to metric space dimensions.
problem Understanding large-scale properties of metric spaces and their subsets.
method Intersection graphs and asymptotic dimension analysis.
result Optimal bounds on asymptotic dimension of intersection graphs.
Let X be a pseudomanifold. In this text, we use a simplicial blow-up to define a cochain complex whose cohomology with coefficients in a field, is isomorphic to the intersection cohomology of X, introduced by M. Goresky and R. MacPherson. We do it simplicially in the setting of a filtered version of face sets, also cal…
Corrects a mistake in a theorem about hyperbolic groups.
problem A theorem about graphs of hyperbolic groups was weakened.
method Identified and corrected a mistake in the published paper.
result Proved a weaker result to correct the main theorem.
The paper explores intersectional fairness in machine learning, proving bounds on it.
problem Intersectional fairness in machine learning, especially when multiple protected attributes are involved.
method Statistical analysis and bounds on intersectional fairness, leveraging marginal fairness.
result Theoretical bounds on intersectional fairness can be computed from marginal fairness and other statistical quantities.
Paper certifies intersection of minimum-volume confidence sets for multinomial outcomes.
problem Certifying intersection of minimum-volume confidence sets for multinomial outcomes.
method Exploits likelihood ordering to induce halfspace constraints, enabling adaptive geometric partitioning and computable bounds on p-values.
result Efficient and provably sound algorithm for certifying intersection, disjointness, or indeterminate result.
Geodesics with bounded angles have zero Hausdorff dimension.
problem Understanding the geometric properties of geodesics with bounded angles.
method Analyzing the Hausdorff dimension of geodesics with specific angle constraints.
result The set of geodesics with bounded self-intersection angles has a Hausdorff dimension of zero.
Study of intersections in Hamiltonian orbits on cotangent bundles.
problem Understanding intersections of projected Hamiltonian orbits in cotangent bundles.
method Generic submersive level set analysis, multi-jet transversality theorem.
result Projected Hamiltonian orbits have discrete intersections, which can be perturbed away under certain conditions.
Study on geodesics proving index and intersection bounds, with examples of multiplicity.
problem Understanding the index and intersections of min-max geodesics on surfaces.
method Proof of tangent cone structure, construction of metrics with multiplicity.
result Upper bounds on index and intersections, examples of multiplicity.
Study on intersection norms and disk complements of curves on surfaces.
problem Understanding intersection norms and their dual polytopes.
method Investigation of polytopes not dual to intersection norms and analysis of curve collections.
result Identification of polytopes not dual to intersection norms and study of curve collections.
Proves curves on surfaces intersect at most once, matching known constructions.
problem Curves on surfaces intersecting at most once.
method Probabilistic argument in graph theory.
result Bound on cardinality of curves on surfaces.
Proves rigidity of homeomorphisms for lamination spaces.
problem Rigidity of homeomorphisms in lamination spaces.
method Analyzes homeomorphisms preserving geometric intersection.
result Two rigidity results for automorphism groups of lamination spaces.
Study intersection polynomials of long virtual knots with supporting genera.
problem Characterize long virtual knots using geometric invariants.
method Define and analyze 1- and 2-supporting genera, and use them to filter long virtual knots. result Provide complete realizability criteria for all twelve intersection polynomials.
Holomorphic foliations on complex manifolds without invariant complete intersections.
problem Holomorphic foliations on complex manifolds without invariant complete intersections.
method Study of holomorphic normal bundle properties and their implications on invariant sets.
result If the holomorphic normal bundle is Griffiths positive, the foliation does not admit a compact invariant set that is a complete intersection of k smooth real hypersurfaces. Study intersection homotopy groups in coarsenings of CS sets.
problem Understanding invariance of intersection homotopy groups in coarsenings of CS sets.
method Introduced a general perversity and its pushforward, established invariance theorems for intersection homotopy groups in coarsenings of CS sets.
result Found invariance theorems for intersection homotopy groups in coarsenings of CS sets.
Interprets SL3-web intersections on surfaces.
problem Interpreting SL3-web intersections on surfaces.
method Intersection pairing between reduced SL3-webs and tropical sets.
result Provides a new proof of flip equivariance.
Paper explores topological invariance in torsion-sensitive intersection homology.
problem Torsion-sensitive intersection homology's topological invariance.
method Analogous to classical intersection homology, investigates invariance of sheaf complexes.
result Provides torsion-sensitive versions of existing invariance theorems and new results.
Consider a transitive action of a Lie group G on a (real analytic) manifold M of dimension m, and two (embedded) submanifolds A and B in M of sufficiently large class and of dimension k and l, respectively. We prove that, for a generic σ∈G, the intersection σ(A)∩B is transversal, whence a su…
Study the intersection of positive closed currents using tangent currents and King's residue formula.
problem Investigate the intersection of positive closed currents in complex manifolds.
method Employ tangent currents and King's residue formula to establish a natural condition for intersection.
result Derive an integral representation of the intersection of positive closed currents.
Study on curves on surfaces with bounds on intersections.
problem Lower bounds on curves filling punctured surfaces.
method Analyzes cardinality of curves intersecting at most k times, and uses systoles on hyperbolic surfaces.
result Establishes orders of growth for intersections, differing for even and odd k.
Study on shortest geodesics crossing multiple times on hyperbolic surfaces with cusps.
problem Finding shortest geodesics crossing multiple times on hyperbolic surfaces.
method Investigates closed geodesics on hyperbolic surfaces with at least one cusp, focusing on minimal length and self-intersection numbers.
result For large enough k, self-intersection numbers are exactly k for geodesics crossing at least k times. We construct examples of C∞ smooth submanifolds in Cn and Rn of codimension 2 and 1, which intersect every complex, respectively real, analytic curve in a discrete set. The examples are realized either as compact tori or as properly imbedded Euclidean spaces, and are the graphs of quasianaly…
Proves intersection properties of minimal hypersurfaces in various spaces.
problem Intersection properties of minimal hypersurfaces in different geometric settings.
method Two approaches: classifications of stable minimal hypersurfaces and conformal change with comparison geometry.
result Intersection properties for minimal hypersurfaces in specific geometric settings, including free boundary minimal hypersurfaces.
I answer an open question left by Gui-Song Li in "On self-intersections of immersed surfaces" (AMS Proceedings, Volume 126, 1998, pp.3721-3726.) The intersection graph M(i) of a generic surface i:F→S3 is the set of values which are either singularities or intersections. It is a multigraph whose edges are trans…
Minimal number of caps covering an n-sphere is n+2.
problem Covering an n-sphere with minimal number of caps.
method Analyzing short closed sets and caps, proving theorems about their intersections and coverings.
result The minimal number of short closed sets (caps) covering an n-sphere is n+2.
The paper calculates 4-manifold properties from a trisection diagram.
problem Computing the homology and intersection form of a 4-manifold from a trisection diagram.
method Expressing the homology and intersection form in terms of curves and intersection pairing on the diagram surface.
result Explicit formulas for the second and third homology groups of X and an algorithm to compute the intersection form. Two flat sub-Lorentzian problems on Martinet distribution differ in attainable set intersections.
problem Flat sub-Lorentzian structures on Martinet distribution.
method Analysis of attainable sets, optimal trajectories, sub-Lorentzian distances and spheres.
result The attainable set for the first problem intersects with the Martinet plane, while for the second it does not.
Several authors have recently attempted to show that the intersection of three simply connected subcontinua of the plane is simply connected provided it is non-empty and the intersection of each two of the continua is path connected. In this note we give a very short complete proof of this fact. We also confirm a relat…
New bounds on curves on torus with few intersections.
problem Finding the maximum number of non-homotopic curves on a torus with limited intersections.
method Analyzing the maximum size of sets of curves with at most k intersections, using combinatorial optimization techniques.
result The maximum size of such a set is k+6 for all k, and k+4 for large k.
Algorithm corrects bias in classification data.
problem Underrepresentation and intersectional bias in classification data.
method Estimate group-wise drop-out rates with small unbiased data, construct reweighting scheme, and present algorithm.
result Efficiently approximate loss of any hypothesis on true distribution.
We show that the adjacency matrices of the intersection graphs of chord diagrams satisfy the 2-term relations of Bar-Natan and Garoufalides [bg], and hence give rise to weight systems. Among these weight systems are those associated with the Conway and HOMFLYPT polynomials. We extend these ideas to looking at a space o…
The first part of this paper exposits a simple geometric description of the Kirby-Siebenmann invariant of a 4--manifold in terms of a quadratic refinement of its intersection form. This is the first in a sequence of higher-order intersection invariants of Whitney towers studied by the authors, particularly for the 4--b…
The paper characterizes and studies compact subsets of complex projective space with specific line intersection properties.
problem Characterizing compact subsets of complex projective space with specific line intersection properties.
method Characterization and study of compact subsets of complex projective space with line intersection properties.
result Characterization of quadratic R-algebraic subsets of complex projective space.
A new method clusters intersecting lines using hypergraphs.
problem Clustering intersecting lines in subspace clustering.
method Constructing a geometric hypergraph and using spectral algorithm.
result Achieves information-theoretic bounds for line clustering.
The study limits intersections of curves on a torus.
problem Bounding intersections of curves on a torus.
method Elementary, combinatorial, and geometric methods.
result The size of distinct homotopy classes of curves intersecting at most k times is k + O(\sqrt{k} \log k).
The study bounds the number of non-intersecting loops on a surface.
problem Bounding the number of non-intersecting loops on a surface.
method Combines probabilistic and covering space arguments, leveraging LERF property of surface groups.
result The bound matches the size of the largest known construction to within a factor of log g.
Solves Plateau's problem for curves with self-intersections.
problem Plateau's problem for singular curves with self-intersections.
method Solution based on Plateau's problem for Jordan curves in metric spaces.
result New solution even in Rn. Alesker has introduced the space V∞(M) of {\it smooth valuations} on a smooth manifold M, and shown that it admits a natural commutative multiplication. Although Alesker's original construction is highly technical, from a moral perspective this product is simply an artifact of the operation of inters…