Related papers: An optimal construction of Hanf sentences
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…
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…
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,…
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…
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…
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.
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…
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…
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…
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…
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.
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…
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…
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…
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…
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,…
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$,…
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…
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.
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…