English
Related papers

Related papers: Krull dimension for limit groups I: Bounding stric…

200 papers

We describe an algorithm that takes as input a complex sequence $(u_n)$ given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound $(v_n)$ such that $|u_n| \leq…

Symbolic Computation · Computer Science 2013-06-19 Marc Mezzarobba , Bruno Salvy

If we know that some kind of sequence always converges, we can ask how quickly and how uniformly it converges. Many convergent sequences converge non-uniformly and, relatedly, have no computable rate of convergence. However proof-theoretic…

Logic · Mathematics 2017-11-21 Henry Towsner

In this paper, we establish upper bounds on the dimension of sets of singular-on-average and \(\omega\)-singular affine forms in singly metric settings, where either the matrix or the shift is fixed. These results partially address open…

Number Theory · Mathematics 2026-05-05 Gaurav Aggarwal

We prove a central limit theorem for the length of the longest subsequence of a random permutation which follows one of a class of repeating patterns. This class includes every fixed pattern of ups and downs having at least one of each,…

Combinatorics · Mathematics 2024-09-25 Aaron Abrams , Eric Babson , Henry Landau , Zeph Landau , James Pommersheim

A group has finite palindromic width if there exists $n$ such that every element can be expressed as a product of $n$ or fewer palindromic words. We show that if $G$ has finite palindromic width with respect to some generating set, then so…

Group Theory · Mathematics 2014-09-16 T. R. Riley , A. W. Sale

We develop the concept of character level for the complex irreducible characters of finite, general or special, linear and unitary groups. We give characterizations of the level of a character in terms of its Lusztig's label and in terms of…

Representation Theory · Mathematics 2020-02-19 Robert M. Guralnick , Michael Larsen , Pham Huu Tiep

In the realm of rank-metric codes, Maximum Rank Distance (MRD) codes are optimal algebraic structures attaining the Singleton-like bound. A major open problem in this field is determining whether an MRD code can be extended to a longer one…

Information Theory · Computer Science 2026-04-02 Daniele Bartoli , Alessandro Giannoni , Giuseppe Marino , Alessandro Neri

We establish new upper bounds for the height of the S-integral points of an elliptic curve. This bound is explicitly given in terms of the set S of places of the number field K involved, but also in terms of the degree of K, as well as the…

Number Theory · Mathematics 2012-08-15 Vincent Bosser , Andrea Surroca

We study the set of normalized multi-lengths for representations of closed surface groups and free groups into $(\mathrm{PSL}_2\mathbf{R})^d$ whose projections to $\mathrm{PSL}_2\mathbf{R}$ are all convex cocompact. These multi-lengths…

Geometric Topology · Mathematics 2026-04-23 Jeffrey Danciger , François Guéritaud , Fanny Kassel

In this paper we provide a criteria for geometric finiteness of Kleinian groups in general dimension. We formulate the concept of conformal finiteness for Kleinian groups in space of dimension higher than two, which generalizes the notion…

Differential Geometry · Mathematics 2007-05-23 Alice Chang , Jie Qing , Paul Yang

Motivated by the effective bounds of ordinary differential equations, we prove an effective version of uniform bounding for partial differential fields with commuting derivations. More precisely, we provide an upper bound for the size of…

Algebraic Geometry · Mathematics 2015-10-28 James Freitag , Omar Leon Sanchez

We study the essential dimension of a finite group G over a field K. A generalization of the central extension theorem of Buhler and Reichstein (Compositio Math. 106 (1997) 159-179, Theorem 5.3) is obtained. We also get lower bounds of…

Algebraic Geometry · Mathematics 2007-05-23 Ming-chang Kang

Recently George Bergman proved that the symmetric group of an infinite set possesses the following property which we call by the {\it universality of finite width}: given any generating set $X$ of the symmetric group of an infinite set…

Group Theory · Mathematics 2007-05-23 Vladimir Tolstykh

In this article we prove several new uniform upper bounds on the number of points of bounded height on varieties over $\mathbb{F}_q[t]$. For projective curves, we prove the analogue of Walsh' result with polynomial dependence on $q$ and the…

Number Theory · Mathematics 2020-03-27 Floris Vermeulen

For semiclassical problems we establish upper bounds on the number of resonances in boxes of size $h$ along the real axis, in terms of the dimension of the set of trapped trajectories. The proof uses second microlocalization.

Spectral Theory · Mathematics 2007-05-23 J. Sjoestrand , M. Zworski

We prove a general criterion for a metric space to have conformal dimension one. The conditions are stated in terms of the existence of enough local cut points in the space. We then apply this criterion to the boundaries of hyperbolic…

Metric Geometry · Mathematics 2013-11-05 Matias Carrasco Piaggio

We derive upper and lower bounds on the sum of distances of a spherical code of size $N$ in $n$ dimensions when $N\sim n^\alpha, 0<\alpha\le 2.$ The bounds are derived by specializing recent general, universal bounds on energy of spherical…

Metric Geometry · Mathematics 2023-03-07 Alexander Barg , Peter Boyvalenkov , Maya Stoyanova

For a prime $r$, we obtain lower bounds on the proportion of $r$-regular elements in classical groups and show that these lower bounds are the best possible lower bounds that do not depend on the order of the defining field. Along the way,…

Group Theory · Mathematics 2014-02-26 László Babai , Simon Guest , Cheryl E. Praeger , Robert A. Wilson

A binary linear error correcting codes represented by two code families Kronecker products sum are considered. The dimension and distance of new code is investigated. Upper and lower bounds of distance are obtained. Some examples are given.…

Information Theory · Computer Science 2007-07-13 Armen Grigoryants

Solving the algebraic dichotomy conjecture for constraint satisfaction problems over structures first-order definable in countably infinite finitely bounded homogeneous structures requires understanding the applicability of…

Logic in Computer Science · Computer Science 2020-01-22 Michał Wrona
‹ Prev 1 4 5 6 7 8 10 Next ›