Related papers: Upper Bounds on Syntactic Complexity of Left and T…

We propose a criterion for preserving the regularity of a formal language representation when passing from groups to subgroups. We use this criterion to show that the regularity of a positive cone language in a left-orderable group passes…

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…

We extend the two-variable logic on data words with guarded regular binary predicates of the form $\widetilde{L}(x,y)$ that is true if positions $x$ and $y$ are in the same class and the factor strictly between $x$ and $y$ is in the regular…

This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…

In this paper we consider the following problems: how many different subsets of Sigma^n can occur as set of all length-n factors of a finite word? If a subset is representable, how long a word do we need to represent it? How many such…

Typestate systems ensure many desirable properties of imperative programs, including initialization of object fields and correct use of stateful library interfaces. Abstract sets with cardinality constraints naturally generalize typestate…

A regular language $L$ is non-returning if in the minimal deterministic finite automaton accepting it there are no transitions into the initial state. Eom, Han and Jir\'askov\'a derived upper bounds on the state complexity of boolean…

We prove that all positive solutions of $-\Delta u = u^{\frac{2n}{n-2}}$ on the upper half space $\mathbb{R}^n_{+}$ (for $n \geq 3$) satisfying the boundary condition $D_{x_n}u = -u^{\frac{n}{n-2}}$ are of the form $u(x) = a \left(…

We establish an upper bound on the cardinality of a minimal generating set for the fundamental group of a large family of connected, balanced simplicial complexes and, more generally, simplicial posets.

We show that the conditional independence (CI) implication problem with bounded cardinalities, which asks whether a given CI implication holds for all discrete random variables with given cardinalities, is co-NEXPTIME-hard. The problem…

We give a new characterization of primitive permutation groups tied to the notion of completely reachable automata. Also, we introduce sync-maximal permutation groups tied to the state complexity of the set of synchronizing words of certain…

We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure,…

We classify the irreducible complex characters of the symplectic groups $Sp_{2n}(q)$ and the orthogonal groups $Spin_{2n}^\pm(q)$, $Spin_{2n+1}(q)$ of degrees up to the bound D, where $D=(q^n-1)q^{4n-10}/2$ for symplectic groups,…

We prove a new lower bound for the unitary synthesis problem in the so-called 1.5-query setting. Our analysis establishes that any attempt to implement arbitrary n-qubit unitaries via limited oracle access requires resources that exceed the…

As speakers turn their thoughts into sentences, they maintain a balance between the complexity of words and syntax. However, it is unclear whether this syntax-lexicon tradeoff is unique to the spoken language production that is under the…

We introduce the problem of temporal coverability for realizability and synthesis. Namely, given a language of words that must be covered by a produced system, how to automatically produce such a system. We consider the case of coverability…

We show that if a semisimple synchronizing automaton with $n$ states has a minimal reachable non-unary subset of cardinality $r\ge 2$, then there is a reset word of length at most $(n-1)D(2,r,n)$, where $D(2,r,n)$ is the $2$-packing number…

We give an explicit description of the lattice $\Semistar(D)$ of all semistar operations on any Dedekind domain $D$ from its set $\Max(D)$ of maximal ideals. This descpription is constructive if $\Max(D)$ is finite. As a corollary we show…

C\^{a}mpeanu and Ho (2004) determined the maximum finite state complexity of finite languages, building on work of Champarnaud and Pin (1989). They stated that it is very difficult to determine the number of maximum-complexity languages.…

We study the two-variable fragments D^2 and IF^2 of dependence logic and independence-friendly logic. We consider the satisfiability and finite satisfiability problems of these logics and show that for D^2, both problems are…