English
Related papers

Related papers: An optimal construction of Hanf sentences

200 papers

Every finite solvable group $G$ has a normal series with nilpotent factors. The smallest possible number of factors in such a series is called the Fitting height $h(G)$. In the present paper, we derive an upper bound for $h(G)$ in terms of…

Group Theory · Mathematics 2021-11-16 Francesco Fumagalli , Felix Leinen , Orazio Puglisi

Let $F$ be a field of characteristic not 2 or 3. The first Tits construction is a well-known tripling process to construct separable cubic Jordan algebras, especially Albert algebras. We generalize the first Tits construction by choosing…

Rings and Algebras · Mathematics 2024-03-26 Thomas Moran , Susanne Pumpluen

We introduce some notions of invariant elementary definability which extend the notions of first-order order-invariant definability, and, more generally, definability invariant with respect to arbitrary numerical relations. In particular,…

Logic · Mathematics 2025-07-17 Steven Lindell , Henry Towsner , Scott Weinstein

We apply a variant of the square-sieve to produce a uniform upper bound for the number of rational points of bounded height on a family of surfaces that admit a fibration over the projective line, whose general fibre is a hyperelliptic…

Number Theory · Mathematics 2021-09-28 Dante Bonolis , Tim Browning

We develop further the theory of symmetrization of fractional Laplacian operators contained in recent works of two of the authors. The theory leads to optimal estimates in the form of concentration comparison inequalities for both elliptic…

Analysis of PDEs · Mathematics 2015-06-25 Yannick Sire , Juan Luis Vazquez , Bruno Volzone

We present a construction of 1-perfect binary codes, which gives a new lower bound on the number of such codes. We conjecture that this lower bound is asymptotically tight.

Combinatorics · Mathematics 2009-09-25 Denis Krotov , Sergey Avgustinovich

We show that the class of representable substitution algebras is characterized by a set of universal first order sentences. In addition, it is shown that a necessary and sufficient condition for a substitution algebra to be representable is…

Logic · Mathematics 2015-03-05 Norman Feldman

A pattern is encountered in a word if some infix of the word is the image of the pattern under some non-erasing morphism. A pattern $p$ is unavoidable if, over every finite alphabet, every sufficiently long word encounters $p$. A theorem by…

Discrete Mathematics · Computer Science 2019-02-15 Arnaud Carayol , Stefan Göller

The theory of Frobenius groups with Frobenius complements of even order largely reduces to tractable algebraic number theory. If we consider only Frobenius complements with an upper bound $s$ on the number of distinct primes dividing the…

Group Theory · Mathematics 2021-02-09 Ron Brown

Several known constructions relate initial degenerations of projective toric varieties and Grassmannians to regular subdivisions of appropriate point configurations. We define a general framework which allows for partial generalizations of…

Combinatorics · Mathematics 2025-05-21 George Balla , Daniel Corey , Igor Makhlin , Victoria Schleis

We find explicit bounds on the primary components and on the Castelnuovo-Mumford regularity of powers of monomial ideals. We also analyze the primary decompositions of Katzman's example.

Commutative Algebra · Mathematics 2007-05-23 Karen E. Smith , Irena Swanson

Suppose that $f(z)$ is a transcendental entire function and that the Fatou set $F(f)\neq\emptyset$. Set $$B_1(f):=\sup_{U}\frac{\sup_{z\in U}\log(|z|+3)}{\inf_{w\in U}\log(|w|+3)}$$ and $$B_2(f):=\sup_{U}\frac{\sup_{z\in…

Complex Variables · Mathematics 2009-11-13 Xiaoling Wang , Wang Zhou

We give a new bound on the number of collinear triples for two arbitrary subsets of a finite field. This improves on existing results which rely on the Cauchy inequality. We then us this to provide a new bound on trilinear and quadrilinear…

Number Theory · Mathematics 2017-09-01 Simon Macourt

The Feferman-Vaught theorem provides a way of evaluating a first order sentence $\varphi$ on a disjoint union of structures by producing a decomposition of $\varphi$ into sentences which can be evaluated on the individual structures and the…

Logic in Computer Science · Computer Science 2022-01-03 Abhisekh Sankaran

We consider elliptic operators with measurable coefficients and Robin boundary conditions on a bounded domain $\Omega \subset \mathbb{R}^d$ and show that the first eigenfunction $v$ satisfies $v(x) \ge \delta > 0$ for all $x \in…

Analysis of PDEs · Mathematics 2020-08-05 Wolfgang Arendt , A. F. M. ter Elst , Jochen Glück

We solve two long-standing open problems on word equations. Firstly, we prove that a one-variable word equation with constants has either at most three or an infinite number of solutions. The existence of such a bound had been conjectured,…

Combinatorics · Mathematics 2018-05-25 Dirk Nowotka , Aleksi Saarela

The Hanf number for a set $S$ of sentences in $L_{\omega_1,\omega}$ (or some other logic) is the least infinite cardinal $\kappa$ such that for all $\varphi\in S$, if $\varphi$ has models in all infinite cardinalities less than $\kappa$,…

Logic · Mathematics 2016-11-02 Sergey Goncharov , Julia Knight , Ioannis Souldatos

We define the universal exponential extension of an algebraically closed differential field and investigate its properties in the presence of a nice valuation and in connection with linear differential equations. Next we prove normalization…

Commutative Algebra · Mathematics 2026-04-28 Matthias Aschenbrenner , Lou van den Dries , Joris van der Hoeven

For arbitrary algebras $L$, we construct Hopf algebroids $A_\sigma$ with base rings $L$ by means of $\sigma^{ab}_{cd}\in L$ satisfying suitable properties.

Rings and Algebras · Mathematics 2019-08-27 Yudai Otsuto , Youichi Shibukawa

Let $A$ and $B$ be sets of words of length $n$ over some finite alphabet. Suppose that no suffix of a word in $A$ coincides with a prefix of a word in $B$. Then we show that the product of densities of $A$ and $B$ is upper bounded by…

Combinatorics · Mathematics 2026-03-04 Dmitrii Zakharov
‹ Prev 1 8 9 10 Next ›