Related papers: From Quantifier Depth to Quantifier Number: Separa…
We describe the layer of quantifier alternation depth at most one of the quantifier completion of a Boolean doctrine over a small category. This amounts to a doctrinal version of Herbrand's theorem for formulas with quantifier alternation…
We propose an approach for quantifying a quantum circuit's quantumness as a means to understand the nature of quantum algorithmic speedups. Since quantum gates that do not preserve the computational basis are necessary for achieving quantum…
In this note we prove that almost cap sets $A \subset \mathbb{F}_q^n$, i.e., the subsets of $\mathbb{F}_q^n$ that do not contain too many arithmetic progressions of length three, satisfy that $|A| < c_q^n$ for some $c_q < q$. As a corollary…
Protocols for discriminating between a pair of channels or for estimating a channel parameter can often be aided by adaptivity or by entanglement between the probe states. This can make it difficult to bound the best possible performance…
An $\mathbb{F}_q$-linear set of rank $k$ on a projective line $\mathrm{PG}(1,q^h)$, containing at least one point of weight one, has size at least $q^{k-1}+1$ (see [J. De Beule and G. Van De Voorde, The minimum size of a linear set, J.…
Given query access to a set of constraints $S$, we wish to quickly check if some objective function $\varphi$ subject to these constraints is at most a given value $k$. We approach this problem using the framework of property testing where…
We contribute to the refined understanding of the language-logic-algebra interplay in the context of first-order properties of countable words. We establish decidable algebraic characterizations of one variable fragment of FO as well as…
By Fagin's Theorem, NP contains precisely those problems that can be described by formulas starting with an existential second-order quantifier, followed by only first-order quantifiers (ESO formulas). Subsequent research refined this…
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…
We provide bounds on the sizes of the gaps -- defined broadly -- in the set $\{k_1\beta_1 + \ldots + k_n\beta_n \mbox{ (mod 1)} : k_i \in \mathbb Z \cap (0,Q^\frac{1}{n}]\}$ for generic $\beta_1, \ldots, \beta_n \in \mathbb R^m$ and all…
We consider d-minimal expansions of ordered fields. We demonstrate the existence of definable quotients of definable sets by definable equivalence relations when several technical conditions are satisfied. These conditions are satisfied…
Model counting is a fundamental problem that consists of determining the number of satisfying assignments for a given Boolean formula. The weighted variant, which computes the weighted sum of satisfying assignments, has extensive…
The existence of $k$-uniform states has been a widely studied problem due to their applications in several quantum information tasks and their close relation to combinatorial objects like Latin squares and orthogonal arrays. With the…
Answering a question of Junker and Ziegler, we construct a countable first order structure which is not omega-categorical, but does not have any proper non-trivial reducts, in either of two senses (model-theoretic, and group-theoretic). We…
Quantum programs today are written at a low level of abstraction - quantum circuits akin to assembly languages - and the unitary parts of even advanced quantum programming languages essentially function as circuit description languages.…
Recent results show that Kochen-Specker (KS) sets of observables are fundamental to quantum information, computation, and foundations beyond previous expectations. Among KS sets, those that are unique up to unitary transformations (i.e.,…
The logarithmic derivative (or, quantum score) of a positive definite density matrix appearing in the quantum Fisher information is discussed, and its exact expression is presented. Then, the problem of estimating the parameters in a class…
We generalize many results concerning the tractability of SAT and #SAT on bounded treewidth CNF-formula in the context of Quantified Boolean Formulas (QBF). To this end, we start by studying the notion of width for OBDD and observe that the…
The uniform one-dimensional fragment of first-order logic was introduced a few years ago as a generalization of the two-variable fragment to contexts involving relations of arity greater than two. Quantifiers in this logic are used in…
With their increasing size, large language models (LLMs) are becoming increasingly good at language understanding tasks. But even with high performance on specific downstream task, LLMs fail at simple linguistic tests for negation or…