Related papers: Computing isomorphisms between lattices
The theory of factor-equivalence of integral lattices establishes a far-reaching relationship between the Galois module structure of the unit group of the ring of integers of a number field and its arithmetic. For a number field $K$ that is…
Given an integer $k\ge3$ and a group $G$ of odd order, if there exists a $2$-$(v,k,1)$-design and if $v$ is sufficiently large, then there is such a design whose automorphism group has a subgroup isomorphic to $G$. A weaker result is proved…
We describe an algorithm for determining whether a finite quandle is isomorphic to an Alexander quandle by finding all possible Alexander presentations of the quandle. We give an implementation of this algorithm in Maple.
Polynomial reconstruction on Cartesian grids is fundamental in many scientific and engineering applications, yet it is still an open problem how to construct for a finite subset $K$ of $\mathbb{Z}^{\textsf{D}}$ a lattice $\mathcal{T}\subset…
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…
If $A$ is a finite-dimensional algebra graded by a group $G$, and $\sigma \in G$, we define a variant of paratrophic matrix associated with $A$ and $\sigma$, and we use it to characterize the $\sigma$-graded Frobenius property for $A$. We…
The isomorphism problem is known to be efficiently solvable for interval graphs, while for the larger class of circular-arc graphs its complexity status stays open. We consider the intermediate class of intersection graphs for families of…
A semi-analytic method to compute the first coefficients of the renormalization group functions on a random lattice is introduced. It is used to show that the two-dimensional $O(N)$ non-linear $\sigma$-model regularized on a random lattice…
Given a row-finite $k$-graph $\Lambda$ with no sources we investigate the $K$-theory of the higher rank graph $C^*$-algebra, $C^*(\Lambda)$. When $k=2$ we are able to give explicit formulae to calculate the $K$-groups of $C^*(\Lambda)$. The…
In this paper it is shown that the lattice of C*-covers of an operator algebra does not contain enough information to distinguish operator algebras up to completely isometric isomorphism. In addition, four natural equivalences of the…
The consistency problem for a class of algebraic structures asks for an algorithm to decide for any given conjunction of equations whether it admits a non-trivial satisfying assignment within some member of the class. By Adyan (1955) and…
Let $W$ be a Coxeter group whose proper parabolic subgroups are finite. According to Theorem~1.12 of [1], if the module of a finite $W$-digraph $\Gamma$ is isomorphic to the module of a $W$-graph over $Q$, then $\Gamma$ is acyclic. We…
The structure of the observable algebra ${\mathfrak O}_{\Lambda}$ of lattice QCD in the Hamiltonian approach is investigated. As was shown earlier, ${\mathfrak O}_{\Lambda}$ is isomorphic to the tensor product of a gluonic…
Let $\mathbf K$ be a finite field, $X$ and $Y$ two curves over $\mathbf K$, and $Y\rightarrow X$ an unramified abelian cover with Galois group $G$. Let $D$ be a divisor on $X$ and $E$ its pullback on $Y$. Under mild conditions the linear…
A manifestly Lorentz-covariant calculus based on two matrix-coordinates and their associated derivatives is introduced. It allows formulating relativistic field theories in any even-dimensional spacetime. The construction extends a…
Let \Lambda be a minimal Kac-Moody group of rank 2 defined over the finite field F_q, where q = p^a with p prime. Let G be the topological Kac-Moody group obtained by completing \Lambda. An example is G=SL_2(K), where K is the field of…
In this article we define an encoding for parabolic permutations that distinguishes between parabolic $231$-avoiding permutations. We prove that the componentwise order on these codes realizes the parabolic Tamari lattice, and conclude a…
Machine learning and pattern recognition techniques have been successfully applied to algorithmic problems in free groups. In this paper, we seek to extend these techniques to finitely presented non-free groups, with a particular emphasis…
For a locally compact abelian group $G$ a simple proof is given for the known fact that a bounded domain $\Omega$ tiles $G$ with translations by a lattice $\Lambda$ if and only if the set of characters of $G$ indexed by the dual lattice of…
We propose an efficient variational method for $Z_2$ lattice gauge theory based on the matrix product ansatz. The method is applied to ladder and square lattices. The Gauss law needs to be imposed on quantum states to guarantee gauge…