Related papers: Efficient algorithms for highly compressed data: T…
A multi-shell generalization of a fermion representation of the q-deformed compact symplectic sp_q(4) algebra is introduced. An analytic form for the action of two or more generators of the Sp_q(4) symmetry on the basis states is determined…
We study word series and extended word series, classes of formal series for the analysis of some dynamical systems and their discretizations. These series are similar to but more compact than B-series. They may be composed among themselves…
In supersymmetric models, very heavy stop squarks introduce large logarithms into the computation of the Higgs boson mass. Although it has long been known that in simple cases these logs can be resummed using effective field theory…
Intrinsic symmetry of the existing protocols of quantum dialogue are explored. It is shown that if we have a set of mutually orthogonal $n$-qubit states {\normalsize $\{|\phi_{0}>,|\phi_{1}>,....,|\phi_{i}<,...,|\phi_{2^{n}-1}>\}$ and a set…
*by a standard (one-tape) Turing machine. It is well-known that the word problem for hyperbolic groups, whence in particular for free groups, can be solved in linear time. However, these algorithms run on machines more complicated than a…
We further develop the massive constructive theory of the Standard Model and use it to calculate the amplitude and squared amplitude for all two-body decays, a collection of weak three-body decays, as well as Higgs decay to four neutrinos.…
Generalized Baumslag-Solitar groups (GBS groups) are groups that act on trees with infinite cyclic edge and vertex stabilizers. Such an action is described by a labeled graph (essentially, the quotient graph of groups). This paper addresses…
Word equations are a crucial element in the theoretical foundation of constraint solving over strings. A word equation relates two words over string variables and constants. Its solution amounts to a function mapping variables to constant…
The loop-expansion of the effective potential in the $O(N)$-symmetric $\phi^4$-model contains generically two types of large logarithms. To resum those systematically a new minimal two-scale subtraction scheme $\tMS$ is introduced in an…
Sparse learning has recently received increasing attention in many areas including machine learning, statistics, and applied mathematics. The mixed-norm regularization based on the L1/Lq norm with q > 1 is attractive in many applications of…
We introduce a flexible class of well-quasi-orderings (WQOs) on words that generalizes the ordering of (not necessarily contiguous) subwords. Each such WQO induces a class of piecewise testable languages (PTLs) as Boolean combinations of…
A large literature specifies conditions under which the information complexity for a sequence of numerical problems defined for dimensions $1, 2, \ldots$ grows at a moderate rate, i.e., the sequence of problems is tractable. Here, we focus…
In this article we show how the structure of Coxeter groups are present in gate sets of reversible and quantum computing. These groups have efficient word problems which means that circuits built from these gates have potential to be…
We discuss the large order behaviour and Borel summability of the topological expansion of models of 2D gravity coupled to general $(p,q)$ conformal matter. In a previous work it was proven that at large order $k$ the string susceptibility…
We show that the compositions of positive integers may be interpreted in terms of powers of some power series, over arbitrary commutative ring. As consequences, several closed formulas for the compositions as well as for the generalized…
Quantum Bit String Comparators (QBSC) operate on two sequences of n-qubits, enabling the determination of their relationships, such as equality, greater than, or less than. This is analogous to the way conditional statements are used in…
In this paper we study summability based on double sequences of complex constants as it is defined in "Linear Operators, General Theory" by N. Dunford and J. T. Schwartz. We define "power double sequences" or infinite "power matrices" as…
We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem for automorphism groups of free groups, and the membership problem for the handlebody subgroup of the mapping class group. All of these…
Testing isomorphism of infinite groups is a classical topic, but from the complexity theory viewpoint, few results are known. S{\'e}nizergues and the fifth author (ICALP2018) proved that the isomorphism problem for virtually free groups is…
We develop a theory of average sizes of kernels of generic matrices with support constraints defined in terms of graphs and hypergraphs. We apply this theory to study unipotent groups associated with graphs. In particular, we establish…