中文
相关论文

相关论文: Limit set intersection theorems for Kleinian group…

200 篇论文

In this paper, we obtain several results on the commensurability of two Kleinian groups and their limit sets. We prove that two finitely generated subgroups $G_1$ and $G_2$ of an infinite co-volume Kleinian group $G \subset…

几何拓扑 · 数学 2010-09-16 Wen-yuan Yang , Yue-ping Jiang

We review the theory of splittings of hyperbolic groups, as determined by the topology of the boundary. We give explicit examples of certain phenomena and then use this to describe limit sets of Kleinian groups up to homeomorphism.

几何拓扑 · 数学 2019-02-07 Peter Haïssinsky , Luisa Paoluzzi , Genevieve Walsh

We consider the relation between geometrically finite groups and their limit sets in infinite-dimensional hyperbolic space. Specifically, we show that a rigidity theorem of Susskind and Swarup ('92) generalizes to infinite dimensions, while…

动力系统 · 数学 2015-09-25 Lior Fishman , David Simmons , Mariusz Urbański

We prove a general likely intersections theorem, a counterpart to the Zilber-Pink conjectures, under the assumption that the Ax-Schanuel property and some mild additional conditions are known to hold for a given category of complex quotient…

代数几何 · 数学 2026-01-14 Sebastian Eterović , Thomas Scanlon

A fundamental result in extremal set theory is Katona's shadow intersection theorem, which extends the Kruskal-Katona theorem by giving a lower bound on the size of the shadow of an intersecting family of $k$-sets in terms of its size. We…

组合数学 · 数学 2020-05-15 Xizhi Liu , Dhruv Mubayi

We determine the structure of the finite groups with the property that every cyclic subgroup is the intersection of maximal subgroups, comparing this property with the one where all proper subgroups are intersections of maximal subgroups.

群论 · 数学 2025-08-07 Andrea Lucchini

A bound on consecutive clique numbers of graphs is established. This bound is evaluated and shown to often be much better than the bound of the Kruskal-Katona theorem. A bound on non-consecutive clique numbers is also proven.

组合数学 · 数学 2007-10-23 Andy Frohmader

Let $G$ be a group. The intersection graph $\Gamma(G)$ of $G$ is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of $G$, and there is an edge between two…

群论 · 数学 2018-05-29 Selçuk Kayacan

Thurston's Ending Lamination Conjecture states that a hyperbolic 3-manifold N with finitely generated fundamental group is uniquely determined by its topological type and its end invariants. In this paper we prove this conjecture for…

几何拓扑 · 数学 2011-03-10 Jeffrey F. Brock , Richard D. Canary , Yair N. Minsky

Katona's intersection theorem states that every intersecting family $\mathcal F\subseteq[n]^{(k)}$ satisfies $\vert\partial\mathcal F\vert\geq\vert\mathcal F\vert$, where $\partial\mathcal F=\{F\setminus x:x\in F\in\mathcal F\}$ is the…

组合数学 · 数学 2022-06-10 Marcelo Sales , Bjarne Schülke

We find lower bounds on the number of intersection points between two relatively exact Hamiltonian isotopic Lagrangians. The bounds are given in terms of the cuplength of the Lagrangian in various multiplicative generalised cohomology…

辛几何 · 数学 2024-05-01 Amanda Hirschi , Noah Porcelli

Consider a general circle packing $\mathcal{P}$ in the complex plane $\mathbb{C}$ invariant under a Kleinian group $\Gamma$. When $\Gamma$ is convex-cocompact or its critical exponent is greater than 1, we obtain an effective…

动力系统 · 数学 2017-02-23 Wenyu Pan

We consider the question of continuity of limit sets for sequences of geometrically finite subgroups of isometry groups of rank-one symmetric spaces, and prove analogues of classical (Kleinian) theorems in this context. In particular we…

几何拓扑 · 数学 2024-07-08 Antonin Guilloux , Theodore Weisman

An $S_k$-set in a group $\Gamma$ is a set $A\subseteq\Gamma$ such that $\alpha_1\cdots\alpha_k=\beta_1\cdots\beta_k$ with $\alpha_i,\beta_i\in A$ implies $(\alpha_1,\ldots,\alpha_k)=(\beta_1,\ldots,\beta_k)$. An $S_k'$-set is a set such…

组合数学 · 数学 2025-09-10 John Byrne , Michael Tait

Classical Kleinian groups are discrete subgroups of isometries of H n. The well-known theory of Kleinian groups starts with the definition of their associated limit set in the boundary of H n , and includes the geometric properties of the…

微分几何 · 数学 2016-09-14 Thierry Barbot

A family of graphs F is said to be triangle-intersecting if for any two graphs G,H in F, the intersection of G and H contains a triangle. A conjecture of Simonovits and Sos from 1976 states that the largest triangle-intersecting families of…

组合数学 · 数学 2012-10-09 David Ellis , Yuval Filmus , Ehud Friedgut

For a torsion free Kleinian group $\Gamma$ without parabolics, we consider the decomposition of the limit set $L(\Gamma)$ into conical and ending limit sets and compare the Patterson-Sullivan measure with the harmonic measure on $L(\Gamma)$…

几何拓扑 · 数学 2013-04-29 Woojin Jeon

For suitable subgroups of a finitely generated group, we define the intersection number of one subgroup with another subgroup and show that this number is symmetric. We also give an interpretation of this number.

几何拓扑 · 数学 2014-11-11 Peter Scott

A finite family $\mathcal F$ of convex sets is $k$-intersecting in $S \subseteq \mathbb{R}^d$ if the intersection of every subset of $k$ convex sets in $\mathcal F$ contains a point in $S$. The Helly number of $S$ is the minimum $k$, if it…

组合数学 · 数学 2025-04-24 Srinivas Arun , Travis Dillon

Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are said to be cross-intersecting if each member of $\mathcal{A}$ intersects each member of $\mathcal{B}$. For any two integers $n$ and $k$ with $0 \leq k \leq n$, let ${[n] \choose \leq…

组合数学 · 数学 2015-06-12 Peter Borg