Related papers: Scott analysis, linear orders and almost periodic …
We characterize the complexity functions of subshifts up to asymptotic equivalence. The complexity function of every aperiodic function is non-decreasing, submultiplicative and grows at least linearly. We prove that conversely, every…
We construct type A partially-symmetric Macdonald polynomials $P_{(\lambda \mid \gamma)}$, where $\lambda \in \mathbb{Z}_{\geq 0}^{n-k}$ is a partition and $\gamma \in \mathbb{Z}_{\geq 0}^k$ is a composition. These are polynomials which are…
This work studies the average complexity of solving structured polynomial systems that are characterized by a low evaluation cost, as opposed to the dense random model previously used. Firstly, we design a continuation algorithm that…
Let kappa be an uncountable regular cardinal. Call an equivalence relation on functions from kappa into 2 Sigma_1^1-definable over H(kappa) if there is a first order sentence F and a parameter R subseteq H(kappa) such that functions…
Linearizability is the commonly accepted notion of correctness for concurrent data structures. It requires that any execution of the data structure is justified by a linearization --- a linear order on operations satisfying the data…
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 give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order -- the extensional order -- and a bistable coherence, which captures…
We consider a broad class of first-order optimization algorithms which are \emph{oblivious}, in the sense that their step sizes are scheduled regardless of the function under consideration, except for limited side-information such as…
The poset of copies of a relational structure ${\mathbb X}$ is the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X})=\{ Y\subset X: {\mathbb Y} \cong {\mathbb X}\}$. Investigating the…
This paper is the extended version of On the Complexity of Infinite Advice Strings (ICALP 2018). We investigate a notion of comparison between infinite strings. In a general way, if M is a computation model (e.g. Turing machines) and C a…
Recently, symbolic structures were proposed as finite representations of potentially infinite first-order structures, where Linear Integer Arithmetic terms and formulas define the domain and interpretations of a structure. We generalize…
We examine the exponentially improved asymptotic expansion of the Lerch zeta function $L(\lambda,a,s)=\sum_{n=1}^\infty \exp (2\pi ni\lambda)/(n+a)^s$ for large complex values of $a$, with $\lambda$ and $s$ regarded as parameters. It is…
We study the asymptotics of Schur polynomials with partitions $\lambda$ which are almost staircase; more precisely, partitions that differ from $((m-1)(N-1),(m-1)(N-2),\ldots,(m-1),0)$ by at most one component at the beginning as…
We study the conditions under which, given a generic quantum system, complexity metrics provide actual lower bounds to the circuit complexity associated to a set of quantum gates. Inhomogeneous cost functions ---many examples of which have…
In this article, we give an explicit relationship of SLE partition functions with Coulomb gas formalism of conformal field theory. We first construct a family of SLE$(\kappa)$ partition functions as Coulomb gas integrals and derive their…
For lack of general algorithmic methods that apply to wide classes of logics, establishing a complexity bound for a given modal logic is often a laborious task. The present work is a step towards a general theory of the complexity of modal…
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed \lambda-calculus and the modal \lambda-calculus. This makes it a highly expressive temporal logic that is capable of expressing various interesting correctness properties of…
A relation modification problem gets a logical structure and a natural number k as input and asks whether k modifications of the structure suffice to make it satisfy a predefined property. We provide a complete classification of the…
In this paper we initiate the study of the computational complexity of learning linear temporal logic (LTL) formulas from examples. We construct approximation algorithms for fragments of LTL and prove hardness results; in particular we…
The finite condensation $\sim_F$ is an equivalence relation defined on a linear order $L$ by $x \sim_F y$ if and only if the set of points lying between $x$ and $y$ is finite. We define an operation $\cdot_F$ on linear orders $L$ and $M$ by…