English
Related papers

Related papers: A growth gap for diffeomorphisms of the interval

200 papers

For r at least 3, p at least 2, we classify all actions of the groups Diff^r_c(R) and Diff^r_+(S1) by C^p -diffeomorphisms on the line and on the circle. This is the same as describing all nontrivial group homomorphisms between groups of…

Geometric Topology · Mathematics 2013-09-10 Kathryn Mann

We investigate the possible values for geometric genera of subvarieties in a smooth projective variety. Values which are not attained are called gaps. For curves on a very general surface in $\mathbb{P}^3$, the initial gap interval was…

Algebraic Geometry · Mathematics 2016-01-27 Ciro Ciliberto , Flaminio Flamini , Mikhail Zaidenberg

Let $\mathcal{F}=\{A_1,A_2,\ldots,A_k\}$ be a collection of finite arithmetic progressions, where each $A_d$ is an initial segment of the set $D_d=\{d,2d,3d,\ldots\}$ of consecutive multiples of a positive integer $d$. Let $m(\mathcal{F})$…

Combinatorics · Mathematics 2026-03-04 Noga Alon , Michał Dębski , Jarosław Grytczuk , Jakub Przybyło

We describe a procedure for the generation of functional digraphs up to isomorphism; these are digraphs with uniform outdegree 1, also called mapping patterns, finite endofunctions, or finite discrete-time dynamical systems. This procedure…

Data Structures and Algorithms · Computer Science 2024-09-04 Oscar Defrain , Antonio E. Porreca , Ekaterina Timofeeva

First, we give a functorial construction of a group associated to a symmetric operad. Applied to the endomorphism operad it gives the group of formal diffeomorphisms. Second, we associate a symmetric operad to any family of decorated graphs…

Mathematical Physics · Physics 2012-02-07 Jean-Louis Loday , Nikolay M. Nikolov

We give a new graph-theoretic proof of Cobham's Theorem which says that the support of an automatic sequence is either sparse or grows at least like $N^\alpha$ for some $\alpha > 0$. The proof uses the notions of tied vertices and cycle…

Combinatorics · Mathematics 2024-05-21 Mieke Wessel

Random walkers absorbing on a boundary sample the Harmonic Measure linearly and independently: we discuss how the recurrence times between impacts enable non-linear moments of the measure to be estimated. From this we derive a new technique…

Statistical Mechanics · Physics 2007-05-23 Ellak Somfai , Nicholas R. Goold , Robin C. Ball , Jason P. DeVita , Leonard M. Sander

We explore how the asymptotic structure of a random $n$-term weak integer composition of $m$ evolves, as $m$ increases from zero. The primary focus is on establishing thresholds for the appearance and disappearance of substructures. These…

Combinatorics · Mathematics 2024-12-20 David Bevan , Dan Threlfall

We study the growth rate of harmonic functions in two aspects: gradient estimate and frequency. We obtain the sharp gradient estimate of positive harmonic function in geodesic ball of complete surface with nonnegative curvature. On complete…

Differential Geometry · Mathematics 2023-06-14 Guoyi Xu

Let $G$ be a finitely generated group with an automorphism $\varphi\in{\rm Aut}(G)$, or an outer automorphism $\phi\in{\rm Out}(G)$. Suppose that $G$ decomposes into simpler pieces on which the growth behaviour of $\varphi$ and $\phi$ is…

Group Theory · Mathematics 2026-03-13 Elia Fioravanti

We study fixed point biased involutions that avoid a pattern. For every pattern of length three we obtain limit theorems for the asymptotic distribution of the (appropriately centered and scaled) number of fixed points of a random fixed…

Probability · Mathematics 2026-01-01 Jungeun Park , Douglas Rizzolo

A $d$-regular graph on $n$ nodes has at most $T_{\max} = \frac{n}{3} \tbinom{d}{2}$ triangles. We compute the leading asymptotics of the probability that a large random $d$-regular graph has at least $c \cdot T_{\max}$ triangles, and…

Combinatorics · Mathematics 2021-04-16 Pim van der Hoorn , Gabor Lippner , Elchanan Mossel

Let P_{n,m} denote the graph taken uniformly at random from the set of all planar graphs on {1,2,..., n} with exactly m(n) edges. We use counting arguments to investigate the probability that P_{n,m} will contain given components and…

Combinatorics · Mathematics 2011-01-27 Chris Dowden

Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…

Computational Geometry · Computer Science 2007-05-23 Rolf Klein , Martin Kutz

Many random growth models have the property that the set of discovered sites, scaled properly, converges to some deterministic set as time grows. Such results are known as shape theorems. Typically, not much is known about the shapes. For…

Machine Learning · Statistics 2020-06-26 Sebastian Rosengren

Let $\mathcal{A}$ be a finite set of $d\times d$ matrices with integer entries and let $m_n(\mathcal{A})$ be the maximum norm of a product of $n$ elements of $\mathcal{A}$. In this paper, we classify gaps in the growth of…

Number Theory · Mathematics 2014-10-22 Jason P. Bell , Michael Coons , Kevin G. Hare

We say that a fixed point of a diffeomorphism is non-degenerate if 1 is not an eigenvalue of the linearization at the fixed point. We use pseudo-holomorphic curves techniques to prove the following: the inclusion map $$i: \text{Diff} ^{1}…

Symplectic Geometry · Mathematics 2016-09-27 Yasha Savelyev

We prove new vanishing results on the growth of higher torsion homologies for suitable arithmetic lattices, Artin groups and mapping class groups. The growth is understood along Farber sequences, in particular, along residual chains. For…

Geometric Topology · Mathematics 2022-12-16 Miklos Abert , Nicolas Bergeron , Mikolaj Fraczyk , Damien Gaboriau

Throughout mathematics there are constructions where an object is obtained as a limit of an infinite sequence. Typically, the objects in the sequence improve as the sequence progresses, and the ideal is reached at the limit. I introduce a…

Logic · Mathematics 2025-10-01 Paul Gorbow

Consider an infinite planar graph with uniform polynomial growth of degree d > 2. Many examples of such graphs exhibit similar geometric and spectral properties, and it has been conjectured that this is necessary. We present a family of…

Probability · Mathematics 2021-03-11 Farzam Ebrahimnejad , James R. Lee