Related papers: An optimal construction of Hanf sentences

In this paper we discourse basises of representable algebras. This question lead to arithmetic problems. We prove algorithmical solvability of exponential-Diophantine equations in rings represented by matrices over fields of positive…

We introduce the logic FOCN(P) which extends first-order logic by counting and by numerical predicates from a set P, and which can be viewed as a natural generalisation of various counting logics that have been studied in the literature. We…

Under categorial grammars that have powerful rules like composition, a simple n-word sentence can have exponentially many parses. Generating all parses is inefficient and obscures whatever true semantic ambiguities are in the input. This…

We study the critical points of the solution of second elliptic equations in divergence and diagonal form with a bounded and positive definite coefficient, under the assumption that the statement of the Hopf lemma holds (sign assumptions on…

We establish a new bound for the exponential sum \begin{eqnarray*} \sum_{x\in\mathcal{X}}\Big|\sum_{y\in \mathcal{Y}}\gamma(y)\exp(2\pi i a \lambda^{xy}/p)\Big|, \end{eqnarray*} where $\lambda$ is an element of the residue ring modulo a…

The Hankel transform H_n[f(x)](q) = int_0^infinity xf(x)J_n(qx)dx is studied for integer n>=-1 and positive parameter q. It is proved that the Hankel transform is given by uniformly and absolutely convergent series in reciprocal powers of…

The Riesz-Sobolev inequality provides a sharp upper bound for a trilinear expression involving convolution of indicator functions of sets. Equality is known to hold only for indicator functions of appropriately situated intervals. We…

We introduce linear programs encoding regular expressions of finite languages. We show that, given a language, the optimum value of the associated linear program is a lower bound on the size of any regular expression of the language.…

The objects of study in this paper are Hopf algebras $H$ which are finitely generated algebras over an algebraically closed field and are extensions of a commutative Hopf algebra by a finite dimensional Hopf algebra. Basic structural and…

Automatic structures are first-order structures whose universe and relations can be represented as regular languages. It follows from the standard closure properties of regular languages that the first-order theory of an automatic structure…

We prove an upper bound for the length of an arithmetic progression represented by an irreducible integral binary quadratic form or a norm form, which depends only on the form and the progression's common difference. For quadratic forms,…

We give a construction of a real number that is normal to all integer bases and continued fraction normal. The computation of the first n digits of its continued fraction expansion performs in the order of n^4 mathematical operations. The…

Let X be the graph in the plane of a pfaffian function f (in the sense of Khovanskii). Suppose X is not algebraic. This note gives an upper bound for the number of rational points on X of height up to X. The bound is uniform in the order…

The Triguarded Fragment (TGF) is among the most expressive decidable fragments of first-order logic, subsuming both its two-variable and guarded fragments without equality. We show that the TGF has the finite model property (providing a…

This note concerns exponential sheaves and the "universal" Fourier transform on them. Fourier invertibility and the subsequent Fourier miracle is demonstrated. Further, t-structures and realizations are constructed and shown to have…

A variational equation of the third order in three-dimensional space is proposed which describes autoparallel curves of some connection.

The minimization of propositional formulae is a classical problem in logic, whose first algorithms date back at least to the 1950s with the works of Quine and Karnaugh. Most previous work in the area has focused on obtaining minimal, or…

We show that the set of threefold canonical thresholds satisfies the ascending chain condition. Moreover, we derive that threefold canonical thresholds in the interval $ (\frac{1}{2}, 1)$ consists of $ \{ \frac{1}{2}+\frac{1}{n}\}_{n \ge 3}…

Improved upper and lower bounds on the number of square-free ternary words are obtained. The upper bound is based on the enumeration of square-free ternary words up to length 110. The lower bound is derived by constructing generalised…

A normal form for edge metrics is derived under the necessary conditions that the metric be normalized and exact. The normal forms for such an edge metric are shown to be in 1-1 correspondence with representative metrics for a reduced…