English
Related papers

Related papers: Finite basis for analytic strong n-gaps

200 papers

The well known binary and decimal representations of the integers, and other similar number systems, admit many generalisations. Here, we investigate whether still every integer could have a finite expansion on a given integer base b, when…

Number Theory · Mathematics 2008-10-03 Christiaan van de Woestijne

While finite graphs have tree-decompositions that efficiently distinguish all their tangles, locally finite graphs with thick ends need not have such tree-decompositions. We show that every locally finite graph without thick ends admits…

Combinatorics · Mathematics 2024-03-25 Raphael W. Jacobs , Paul Knappe

Let (X,d) be a finite metric space. This paper first discusses the spectrum of the p-distance matrix of a finite metric space of p-negative type and then gives upper and lower bounds for the so called gap of a finite metric space of strict…

Metric Geometry · Mathematics 2016-04-22 Reinhard Wolf

In this short note we count the finite semirings up to isomorphism, and up to isomorphism and anti-isomorphism for some small values of $n$; for which we utilise the existing library of small semigroups in the GAP package Smallsemi.

Rings and Algebras · Mathematics 2025-12-02 J. Edwards , J. D. Mitchell , P. Ragavan

We show the existence of Lipschitz-free spaces verifying the Point of Continuity Property with arbitrarily high weak-fragmentability index. For this purpose, we use a generalized construction of the countably branching diamond graphs. As a…

Functional Analysis · Mathematics 2025-04-25 Estelle Basset

It is proved that there exists an (omega-1,omega-1) Souslin gap in the Boolean algebra (L(nu)/Fin,subseteq^*_ae) for every nonseparable measure nu. Thus a Souslin, also known as destructible, (omega-1,omega-1) gap in P(N)/Fin can always be…

Logic · Mathematics 2007-10-30 James Hirschorn

A simplified construction is presented for Komj\'ath's result that for every uncountable cardinal $\kappa$, there are $2^\kappa$ graphs of size $\kappa$ none of them being a minor of another.

Combinatorics · Mathematics 2020-05-13 Max Pitz

We prove:(1) the existence, for every integer n > 3, of a noncompact smooth n-dimensional topological manifold whose diffeomorphism group contains an isomorphic copy of every finitely presented group; (2) a finiteness theorem on finite…

Group Theory · Mathematics 2014-01-07 Vladimir L. Popov

Let $A$ be an additive basis. We call ``essential subset'' of $A$ any finite subset $P$ of $A$ such that $A \setminus P$ is not an additive basis and that $P$ is minimal (for the inclusion order) to have this property. A recent theorem due…

Number Theory · Mathematics 2008-07-23 Bakir Farhi

We discuss upper and lower bounds for the size of gaps in the length spectrum of negatively curved manifolds. For manifolds with algebraic generators for the fundamental group, we establish the existence of exponential lower bounds for the…

Dynamical Systems · Mathematics 2016-02-16 Dmitry Dolgopyat , Dmitry Jakobson

We prove the existence of gaps between all the different classes of matrix monotone functions defined on an interval, provided the interval is non trivial and different from the whole real line. We then show how matrix monotone functions…

Operator Algebras · Mathematics 2007-05-23 Frank Hansen , Guoxing Ji , Jun Tomiyama

The deficiency of a group is the maximum over all presentations for that group of the number of generators minus the number of relators. Every finite group has non-positive deficiency. We show that every non-positive integer is the…

Group Theory · Mathematics 2018-05-09 Giles Gardam

We give tight lower and upper bounds on the expected missing mass for distributions over finite and countably infinite spaces. An essential characterization of the extremal distributions is given. We also provide an extension to totally…

Statistics Theory · Mathematics 2011-11-10 Daniel Berend , Aryeh Kontorovich

We show how to fill "countable" gaps in Hardy fields. We use this to prove that any two maximal Hardy fields are back-and-forth equivalent.

Logic · Mathematics 2024-06-19 Matthias Aschenbrenner , Lou van den Dries , Joris van der Hoeven

The empty set of course contains no computable point. On the other hand, surprising results due to Zaslavskii, Tseitin, Kreisel, and Lacombe assert the existence of NON-empty co-r.e. closed sets devoid of computable points: sets which are…

Logic in Computer Science · Computer Science 2011-08-04 Stéphane Le Roux , Martin Ziegler

We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…

Group Theory · Mathematics 2021-10-27 Emmanuel Rauzy

This paper studies effective separability for subgroups of finitely generated nilpotent groups and more broadly effective subgroup separability of finitely generated nilpotent groups. We provide upper and lower bounds that are polynomial…

Group Theory · Mathematics 2018-10-02 Jonas Deré , Mark Pengitore

We study the space of ends of groups. For a finitely generated group, this is a Cantor space as soon as it is infinite. In contrast, we show that for infinitely generated countable groups, it exhibits several behaviors. For instance, we…

Group Theory · Mathematics 2019-07-03 Yves Cornulier

In a recent joint work with D.A. Goldston and C.Y. Yildirim we just missed by a hairbreadth a proof that bounded gaps between primes occur infinitely often. In the present work it is shown that adding to the primes a much thinner set,…

Number Theory · Mathematics 2010-04-08 Janos Pintz

We prove that any finitely generated one ended group has linear end depth. Moreover, we give alternative proofs to theorems relating the growth of a finitely generated group to the number of its ends.

Group Theory · Mathematics 2012-07-05 Martha Giannoudovardi