Related papers: The complexity of Presburger arithmetic with power…
We revisit the notion of intuitionistic equivalence and formal proof representations by adopting the view of formulas as exponential polynomials. After observing that most of the invertible proof rules of intuitionistic (minimal)…
Determining the asymptotic algebraic complexity of matrix multiplication, succinctly represented by the matrix multiplication exponent $\omega$, is a central problem in algebraic complexity theory. The best upper bounds on $\omega$, leading…
Craig interpolation has emerged as an effective means of generating candidate program invariants. We present interpolation procedures for the theories of Presburger arithmetic combined with (i) uninterpreted predicates (QPA+UP), (ii)…
Given $b=-A\pm i$ with $A$ being a positive integer, we can represent any complex number as a power series in $b$ with coefficients in $\mathcal A=\{0,1,\ldots, A^2\}$. We prove that, for any real $\tau\geq 2$ and any non-empty proper…
Word equations are a crucial element in the theoretical foundation of constraint solving over strings, which have received a lot of attention in recent years. A word equation relates two words over string variables and constants. Its…
It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…
We investigate exponential sums over those numbers $\leq x$ all of whose prime factors are $\leq y$. We prove fairly good minor arc estimates, valid whenever $\log^{3}x \leq y \leq x^{1/3}$. Then we prove sharp upper bounds for the $p$-th…
We consider the cubic nonlinear Schr\"odinger equation (NLS) on $\mathbb{R}^3$ with randomized initial data. In particular, we study an iterative approach based on a partial power series expansion in terms of the random initial data. By…
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theorem. We show that it has a PSPACE-complete satisfiability problem…
We study linear-time temporal logics interpreted over data words with multiple attributes. We restrict the atomic formulas to equalities of attribute values in successive positions and to repetitions of attribute values in the future or…
In this paper we explore the theory of fractional powers of non-negative (and not necessarily self-adjoint) operators and its amazing relationship with the Chebyshev polynomials of the second kind to obtain results of existence, regularity…
The extended L\"uroth's Theorem says that if the transcendence degree of $\KK(\mathsf{f}_1,\dots,\mathsf{f}_m)/\KK$ is 1 then there exists $f \in \KK(\underline{X})$ such that $\KK(\mathsf{f}_1,\dots,\mathsf{f}_m)$ is equal to $\KK(f)$. In…
Given a sound first-order p-time theory $T$ capable of formalizing syntax of first-order logic we define a p-time function $g_T$ that stretches all inputs by one bit and we use its properties to show that $T$ must be incomplete. We leave it…
Threshold automata are a formalism for modeling and analyzing fault-tolerant distributed algorithms, recently introduced by Konnov, Veith, and Widder, describing protocols executed by a fixed but arbitrary number of processes. We conduct…
It is shown that a consistent application of Bayesian updating from a prior probability density to a posterior using evidence in the form of expectation constraints leads to exactly the same results as the application of the maximum entropy…
Sequence prediction methods for dynamical systems with long memory, i.e. marginally stable systems, typically achieve regret that grows polynomially with the hidden dimension of the underlying generative model. Universal Sequence…
In 2020, Roger Baker \cite{Bak} proved a result on the exceptional set of moduli in the prime number theorem for arithmetic progressions of the following kind. Let $\mathcal{S}$ be a set of pairwise coprime moduli $q\le x^{9/40}$. Then the…
Exponential divided differences arise in numerical linear algebra, matrix-function evaluation, and quantum Monte Carlo simulations, where they serve as kernel weights for time evolution and observable estimation. Efficient and numerically…
We tackle the issue of representing infinite sets of real- valued vectors. This paper introduces an operator for combining integer and real sets. Using this operator, we decompose three well-known logics extending Presburger with reals. Our…
We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width…