Related papers: An optimal construction of Hanf sentences
Given a suitable arithmetic function h, we investigate the average order of h as it ranges over the values taken by an integral binary form F. A general upper bound is obtained for this quantity, in which the dependence upon the…
Another approach to constructing an upper bound for the Riemann-Farey sum is described.
The $\lambda$-superposition calculus is a successful approach to proving higher-order formulas. However, some parts of the calculus are extremely explosive, notably due to the higher-order unifier enumeration and the functional…
We provide elementary algorithms for two preservation theorems for first-order sentences (FO) on the class \^ad of all finite structures of degree at most d: For each FO-sentence that is preserved under extensions (homomorphisms) on \^ad, a…
We consider the regular balanced model of formula generation in conjunctive normal form (CNF) introduced by Boufkhad, Dubois, Interian, and Selman. We say that a formula is $p$-satisfying if there is a truth assignment satisfying…
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…
The method of constructing approximate solutions of the first boundary value problem for linear differential equations based on incomplete (even and odd) trigonometric splines is considered. The theoretical positions are illustrated by…
The syntactic Merge operation of the Minimalist Program in linguistics can be described mathematically in terms of Hopf algebras, with a formalism similar to the one arising in the physics of renormalization. This mathematical formulation…
An elementary method is given for estimates of the norms of the Toeplitz operators, determined by rational inner functions
We present a simple and convenient analytical formula for efficient exact computation of the hafnian of Toeplitz matrices of a special type. An interpretation of the obtained results is given in the language of perfect matchings and Bessel…
From known effective bounds on the prime counting function of the form \[ |\pi(x)-\mathrm{Li}(x)| < a \;x \;(\ln x)^{b} \; \exp\left(-{c}\; \sqrt{\ln x}\right); \qquad (x \geq x_0); \] it is possible to establish exponentially tight…
An approach to constructing an upper bound for the Riemann-Farey sum is described.
We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…
We consider a class of double exponential sums studied in a paper of Sinai and Ulcigrai. They proved a linear bound for these sums along the sequence of denominators in the continued fraction expansion of $\alpha$, provided $\alpha$ is…
For each $n \geq 2$, $l \geq 3$, let ${ES}_L (l,n)$ be the minimum $N$ such that every family of $N$-lines in the plane contains either $l$ concurrent lines or $n$ lines in convex position. In this papar, we give the upper and lower bounds…
Let $M$ be an $m$-dimensional compact Riemannian manifold with boundary. We obtain the upper bound of the harmonic mean of the first $m$ nonzero Neumann eigenvalues and Steklov eigenvalues involving the conformal volume and relative…
We begin the paper with a Hopf's lemma for a fractional p-Laplacian problem on a half-space. Specifically speaking, we show that the derivative of the solution along the outward normal vector is strictly positive on the boundary of the…
We study and partially classify cubic rational expressions $g(x)/h(x)$ over a finite field $\mathbb{F}_q$, up to pre- and post-composition with independent M\"obius transformations. In particular, we obtain a full classification when $q$ is…
We prove elementary recursive bounds in the degrees for Positivstellensatz and Hilbert 17-th problem, which is the expression of a nonnegative polynomial as a sum of squares of rational functions. We obtain a tower of five exponentials. A…
We construct a binary minimal subshift whose words of length n form a connected subset of the Hamming graph for each n.