Related papers: Efficient algorithms for highly compressed data: T…
Power system optimization models are large mathematical models used by researchers and policymakers that pose tractability issues when representing real-world systems. Several aggregation techniques have been proposed to address these…
We give lower bounds on the complexity of the word problem of certain non-solvable groups: for a large class of non-solvable infinite groups, including in particular free groups, Grigorchuk's group and Thompson's groups, we prove that their…
We consider renormalisable models extended in the scalar sector by a generic scalar field in addition to the standard model Higgs boson field, and work out the effective theory for the latter in the decoupling limit. We match the full…
We give a simpler proof using automata theory of a recent result of Kapovich, Weidmann and Myasnikov according to which so-called benign graphs of groups preserve decidability of the generalized word problem. These include graphs of groups…
We show that for any finite-rank free group $\Gamma$, any word-equation in one variable of length $n$ with constants in $\Gamma$ fails to be satisfied by some element of $\Gamma$ of word-length $O(\log (n))$. By a result of the first…
We study the computational complexity of the Word Problem (WP) in free solvable groups $S_{r,d}$, where $r \geq 2$ is the rank and $d \geq 2$ is the solvability class of the group. It is known that the Magnus embedding of $S_{r,d}$ into…
Huffman coding is a widely used method for lossless data compression because it optimally stores data based on how often the characters occur in Huffman trees. An $n$-ary Huffman tree is a connected, cycle-lacking graph where each vertex…
We describe the proalgebraic groups represented by three Hopf algebras on planar binary trees previously introduced by the author and Christian Brouder in relation with the renormalization of quantum electrodynamics. Using two monoidal…
We considered folded spinning string in AdS_5 x S^5 background dual to the Tr(D^S Phi^J) operators of N=4 SYM theory. In the limit S,J-> \infty and l=pi J/\sqrt\lambda\log S fixed we compute the string energy with the 2-loop accuracy in the…
Compositional generalization refers to a model's capability to generalize to newly composed input data based on the data components observed during training. It has triggered a series of compositional generalization analysis on different…
We prove that constant-depth quantum circuits are more powerful than their classical counterparts. To this end we introduce a non-oracular version of the Bernstein-Vazirani problem which we call the 2D Hidden Linear Function problem. An…
In this paper we apply our results on the geometry of polygons in Cartan subspaces, symmetric spaces and buildings to four problems in algebraic group theory. Two of these problems are generalizations of the problems of finding the…
This paper has two parts, on Baumslag-Solitar groups and on general G-trees. In the first part we establish bounds for stable commutator length (scl) in Baumslag-Solitar groups. For a certain class of elements, we further show that scl is…
The word problem of a group is a very important question. The word problem in the braid group is of particular interest for topologists, algebraists and geometers. In previouse article we have looked at the braid group from a topological…
Gaussian elimination is used in special linear groups to solve the word problem. In this paper, we extend Gaussian elimination to unitary groups. These algorithms have an application in building a public-key cryptosystem, we demonstrate…
A large number of NP-hard graph problems can be solved in $f(w)n^{O(1)}$ time and space when the input graph is provided together with a tree decomposition of width $w$, in many cases with a modest exponential dependence $f(w)$ on $w$.…
We generalize the classical definition of effectively closed subshift to finitely generated groups. We study classical stability properties of this class and then extend this notion by allowing the usage of an oracle to the word problem of…
Word equations are a crucial element in the theoretical foundation of constraint solving over strings, which have received a lot of attention in recent years. A word equation relates two words over string variables and constants. Its…
Many $q$-ary stabilizer quantum codes can be constructed from Hermitian self-orthogonal $q^2$-ary linear codes. This result can be generalized to $q^{2 m}$-ary linear codes, $m > 1$. We give a result for easily obtaining quantum codes from…
We develop an algorithmic, system-specific renormalization group (RG) procedure that is adapted from model reductions techniques from engineering control theory. The resulting "generalized" RG is a consistent generalization of the Wilsonian…