Related papers: Symmetric Groups and Quotient Complexity of Boolea…
Second-order Boolean logic is a generalization of QBF, whose constant alternation fragments are known to be complete for the levels of the exponential time hierarchy. We consider two types of restriction of this logic: 1) restrictions to…
Buhrman, Cleve and Wigderson (STOC'98) showed that for every Boolean function f : {-1,1}^n to {-1,1} and G in {AND_2, XOR_2}, the bounded-error quantum communication complexity of the composed function f o G equals O(Q(f) log n), where Q(f)…
We prove a general lower bound on the bounded-error entanglement-assisted quantum communication complexity of Boolean functions. The bound is based on the concept that any classical or quantum protocol to evaluate a function on distributed…
We give a unified construction of quantum groups, q-Boson algebras and quantized Weyl algebras and an action of quantum groups on quantized Weyl algebras. This enables us to give a conceptual proof of the semi-simplicity of the category…
Motivated by the recent rapid development of complexity theory applied to quantum mechanical processes we present the complete derivation of Nielsen's complexity of unitaries belonging to the representations of oscillator group. Our…
In the quantization of a rotating rigid body, a {\it top,} one is concerned with the Hamiltonian operator $L_\alpha=\alpha_0^2 L_x^2 + \alpha_1^2 L_y^2 + \alpha_2^2 L_z^2,$ where $\alpha_0 < \alpha_1 <\alpha_2.$ An explicit formula is known…
Large Language Models (LLMs) have achieved human-level proficiency across diverse tasks, but their ability to perform rigorous mathematical problem solving remains an open challenge. In this work, we investigate a fundamental yet…
We study the satisfiability problem of symbolic finite automata and decompose it into the satisfiability problem of the theory of the input characters and the monadic second-order theory of the indices of accepted words. We use our…
We investigate two operators on classes of regular languages: polynomial closure (Pol) and Boolean closure (Bool). We apply these operators to classes of group languages G and to their well-suited extensions G+, which is the least Boolean…
Lie group theory states that knowledge of a $m$-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by $m$ the number of equation. We apply this principle by finding dilatations and…
An automaton is said to be synchronizing if there is a word in the transitions which sends all states of the automaton to a single state. Research on this topic has been driven by the \v{C}ern\'y conjecture, one of the oldest and most…
A monotone Boolean circuit is composed of OR gates, AND gates and input gates corresponding to the input variables and the Boolean constants. It is $q$-multilinear if for each its output gate $o$ and for each prime implicant $s$ of the…
We show that the Word Problem in finitely generated subgroups of $\textsf{GL}_d(\mathbb{Z})$ can be solved in linear average-case complexity. This is done under the bit-complexity model, which accounts for the fact that large integers are…
In this paper we define a new descriptional complexity measure for Deterministic Finite Automata, BC-complexity, as an alternative to the state complexity. We prove that for two DFAs with the same number of states BC-complexity can differ…
We develop new tools to analyze the complexity of the conjugacy equivalence relation $E_\mathsf{lo}(G)$, whenever $G$ is a left-orderable group. Our methods are used to demonstrate non-smoothness of $E_\mathsf{lo}(G)$ for certain groups $G$…
We continue the semiclassical analysis of the Loop Quantum Gravity (LQG) volume operator that was started in the companion paper [23]. In the first paper we prepared the technical tools, in particular the use of complexifier coherent states…
Quantification has been proven to be a particularly difficult linguistic phenomenon for (Multimodal) Large Language Models (MLLMs). However, given that quantification interfaces with the logic, pragmatic, and numerical domains, the exact…
In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…
The Lorentz transformation group $SO(m,n)$ is a group of Lorentz transformations of order $(m,n)$, that is, a group of special linear transformations in a pseudo-Euclidean space of signature $(m,n)$ that leave the pseudo-Euclidean inner…
We study structure of pure morphic and morphic sequences and prove the following result: the subword complexity of arbitrary morphic sequence is either $\Theta(n^{1+1/k})$ for some $k\in\mathbb N$, or is $O(n \log n)$.