Related papers: Symmetric Groups and Quotient Complexity of Boolea…
We introduce regular language states, a family of quantum many-body states. They are built from a special class of formal languages, called regular, which has been thoroughly studied in the field of computer science. They can be understood…
For a word $S$, let $f(S)$ be the largest integer $m$ such that there are two disjoints identical (scattered) subwords of length $m$. Let $f(n, \Sigma) = \min \{f(S): S \text{is of length} n, \text{over alphabet} \Sigma \}$. Here, it is…
In the present work, we lay out a new theory showing that all automata can always be co-lexicographically partially ordered, and an intrinsic measure of their complexity can be defined and effectively determined, namely, the minimum width…
We propose a regularization of the formal differential expression of order $m \geqslant 3$ $$ l(y) = i^my^{(m)}(t) + q(t)y(t), \,t \in (a, b), $$ applying quasi-derivatives. The distribution coefficient $q$ is supposed to have an…
In this paper we establish some bounds on the complexity of disjunctive normal forms of boolean function from narrow subclasses (e.g. functions takes value 0 in a limited number of points). The bounds are obtained by reduction the initial…
We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and…
The aim of the present paper is to define and study a new class of groups, namely Wm-groups with a single binary operation based on axioms of semi commutativity, right identity and left inverse. Moreover, we introduce the notions of right…
Suppose a compact Lie group acts on a polarized complex projective manifold (M,L). Under favorable circumstances, the Hilbert-Mumford quotient for the action of the complexified group may be described as a symplectic quotient (or…
Though English sentences are typically inflexible vis-\`a-vis word order, constituents often show far more variability in ordering. One prominent theory presents the notion that constituent ordering is directly correlated with constituent…
We consider the state complexity of basic operations on tree languages recognized by deterministic unranked tree automata. For the operations of union and intersection the upper and lower bounds of both weakly and strongly deterministic…
The downward and upward closures of a regular language $L$ are obtained by collecting all the subwords and superwords of its elements, respectively. The downward and upward interiors of $L$ are obtained dually by collecting words having all…
In a recent thread of papers, we have introduced FQL, a precise specification language for test coverage, and developed the test case generation engine FShell for ANSI C. In essence, an FQL test specification amounts to a set of regular…
We investigate the complexity of uniform OR circuits and AND circuits of polynomial-size and depth. As their name suggests, OR circuits have OR gates as their computation gates, as well as the usual input, output and constant (0/1) gates.…
Linear operators preserving the direct sum of polynomial rings P(m)\oplus P(n) are constructed. In the case |m-n|=1 they correspond to atypical representations of the superalgebra osp(2,2). For |m-n|=2 the generic, finite dimensional…
Let $A_N$ denote nondeterministic automatic complexity and \[ L_{k,c}=\{x\in [k]^* : A_N(x)> |x|/c\}. \] In particular, $L_{k,2}$ is the language of all $k$-ary words for which $A_N$ is maximal, while $L_{k,3}$ gives a rough dividing line…
The approximate degree of a Boolean function is the minimum degree of real polynomial that approximates it pointwise. For any Boolean function, its approximate degree serves as a lower bound on its quantum query complexity, and generically…
Understanding the complexity of quantum states and circuits is a central challenge in quantum information science, with broad implications in many-body physics, high-energy physics and quantum learning theory. A common way to model the…
We introduce a concise quantum operator formula for bosonization in which the Lie group structure appears in a natural way. The connection between fermions and bosons is found to be exactly the connection between Lie group elements and the…
In this work, we study the relative hardness of fundamental problems with state-of-the-art word RAM algorithms that take $O(n\sqrt{\log n})$ time for instances described in $\Theta(n)$ machine words ($\Theta(n\log n)$ bits). This complexity…
An open problem in communication complexity proposed by several authors is to prove that for every Boolean function f, the task of computing f(x AND y) has polynomially related classical and quantum bounded-error complexities. We solve a…