Related papers: De Bruijn Tori Without Zeros: A Field-Theoretic Pe…
A special type of cyclic sequences named adjacency-hopping de Bruijn sequences is introduced in this paper. It is theoretically proved the existence of such sequences, and the number of such sequences is derived. These sequences guarantee…
We use modular arithmetic to construct a de Bruijn array containing all fillings of an L (a 2 x 2 array with the upper right corner removed) with digits chosen from {0,...,k-1}.
For a reductive group over a $p$-adic field, DeBacker gives a paramaterization of the conjugacy classes of maximal unramified tori using Bruhat-Tits theory. On the other hand, for unramified classical groups, Waldspurger gives a…
We introduce the tree-decomposition-based parameter totally $\Delta$-modular treewidth (TDM-treewidth) for matrices with two nonzero entries per row. We show how to solve integer programs whose matrices have bounded TDM-treewidth in…
All gauge bosons of a non-abelian gauge theory do not transform the same way under the discrete transformations of time-reversal and charge-conjugation. Moreover, the transformations rules depend on how the generators are chosen. We show…
We describe a new regularization of quantum field theory on the noncommutative torus by means of one-dimensional matrix models. The construction is based on the Elliott-Evans inductive limit decomposition of the noncommutative torus…
The noncommutative (or mixed) trace algebra $T_{nd}$ is generated by $d$ generic $n\times n$ matrices and by the algebra $C_{nd}$ generated by all traces of products of generic matrices, $n,d\geq 2$. It is known that over a field of…
Using Rieffel's construction of projective modules over higher dimensional noncommutative tori, we construct projective modules over some continuous field of C*-algebras whose fibers are noncommutative tori. Using a result of Echterhoff et…
We characterize isotropic trialitarian triples in terms of the Schur indices of the underlying algebras over a base field $F$ of arbitrary characteristic satisfying $I_q^3 F=0$. We also construct anisotropic trialitarian triples over such…
Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…
Every finite-dimensional representation of an algebraic group G gives a trace symmetric bilinear form on the Lie algebra of G. We give criteria in terms of root system data for the existence of a representation such that this form is…
The S-matrices for non-simply-laced affine Toda field theories are considered in the context of a generalised bootstrap principle. The S-matrices, and in particular their poles, depend on a parameter whose range lies between the Coxeter…
In this paper we give a fully combinatorial description of the zero entropy periodic patterns on trees. Unlike previously known characterizations of such patterns, our criterion is independent of any particular topological realization of…
We study the problem when every matrix over a division ring is representable as either the product of traceless matrices or the product of semi-traceless matrices, and also give some applications of such decompositions. Specifically, we…
In this paper we introduce a method to obtain algebraic information using arithmetic one in the study of tori and their principal homogeneous spaces. In particular, using some results of the authors with Tingyu Lee, we determine the…
A set of n points in the plane which are not all collinear defines at least n distinct lines. Chen and Chv\'atal conjectured in 2008 that a similar result can be achieved in the broader context of finite metric spaces. This conjecture…
We define and study analogues of exponentials for functions on noncommutative two-tori that depend on a choice of a complex structure. The major difference with the commutative case is that our noncommutative exponentials can be defined…
General treebank analyses are graph structured, but parsers are typically restricted to tree structures for efficiency and modeling reasons. We propose a new representation and algorithm for a class of graph structures that is flexible…
In order to extrincate the structure of corings with a finitely generated and projective generator we give the notion of a comatrix coring. As consequences we give generalizations of the main characterizations of faithfully flat Galois…
Let $n \ge 2$ be an integer. In this note, we show that the {\it oriented} transition matrices over the field $\mathcal R$ of all real numbers (over the finite field $\mathcal Z_2$ of two elements respectively) of all continuous {\it vertex…