Related papers: Linear tail-biting trellises: Characteristic gener…
Let F be a non-archimedean local field and G be the group GL(N,F). Let \pi be a smooth complex representation of G lying in the Bernstein block B(\pi) of some simple type in the sense of Bushnell and Kutzko. Refining the approach of the…
A new ensemble of structured codes is introduced. These codes are called Quasi Linear Codes (QLC). The QLC's are constructed by taking subsets of linear codes. They have a looser structure compared to linear codes and are not closed under…
Sequence generators obtained by linear recursions over the two-element field $\mathbb{F}_2$, i.e., $\mathbb{F}_2$-linear generators, are widely used as pseudorandom number generators. For example, the Mersenne Twister MT19937 is one of the…
This paper introduces a framework for constructing Calderbank-Shor-Steane (CSS) codes that support fault-tolerant logical transversal $Z$-rotations. Using this framework, we obtain asymptotically good CSS codes that fault-tolerantly realize…
In this paper, we introduce the notion of nullnorms on bounded trellises and study some basic properties. Based on the existence of $t$-norms and $t$-conorms on arbitrary bounded trellises, we propose some construction methods of nullnorms…
We develop an asymptotic theory for extremes in decomposable graphical models by presenting results applicable to a range of extremal dependence types. Specifically, we investigate the weak limit of the distribution of suitably normalised…
We prove the Demailly--Peternell--Schneider conjecture in positive characteristic: if $X$ is a smooth projective variety over an algebraically closed field of characteristic $p>0$ with $-K_X$ is nef, then the Albanese morphism $a: X \to A$…
An important code of length $n^2$ is obtained by taking centralizer of a square matrix over a finite field $\mathbb{F}_q$. Twisted centralizer codes, twisted by an element $a \in \mathbb{F}_q$, are also similar type of codes but different…
In this work we consider deterministic, symmetric matrices with heavy-tailed noise imposed on entries within a fixed distance $K$ to the diagonal. The most important example is discrete 1d random Schr\"odinger operator defined on…
We describe a pair of constructions of Eisenstein lattices from ternary codes, and a corresponding pair of constructions of conformal field theories from lattices which turn out to have a string theoretic interpretation. These are found to…
In this paper, we extend the theory CCS for trees (CCTS) to value-passing CCTS (VCCTS), of which symbols have the capacity for receiving and sending data values, and a nonsequential semantics is proposed in an operational approach. In this…
Combinatorial neural codes are $0/1$ vectors that are used to model the co-firing patterns of a set of place cells in the brain. One wide-open problem in this area is to determine when a given code can be algorithmically drawn in the plane…
The variety DA of finite monoids has a huge number of different characterizations, ranging from two-variable first-order logic FO^2 to unambiguous polynomials. In order to study the structure of the subvarieties of DA, Trotter and Weil…
It is an oft-cited fact that no quantum code can support a set of fault-tolerant logical gates that is both universal and transversal. This no-go theorem is generally responsible for the interest in alternative universality constructions…
The paper relates character value of an irreducible representation of a compact connected Lie group at certain elements of finite order with the dimension of a representation on another group, up to some precise constants, which all have…
Linear codes over finite fields parameterized by functions have proven to be a powerful tool in coding theory, yielding optimal and few-weight codes with significant applications in secret sharing, authentication codes, and association…
Let F be a finite extension of Qp and G be GL(2,F). When V is the tensor product of three admissible, irreducible, finite dimensional representations of G, the space of G-invariant linear forms has dimension at most one. When a non zero…
We introduce trim resolutions of complex algebraic varieties, a strengthening of the notion of small resolution. We prove that the characteristic cycle of the intersection cohomology sheaf of a variety admitting a trim resolution is…
In the paper Blocked-braid Groups, submitted to Applied Categorical Structures, the present authors together with Davide Maglia introduced the blocked-braid groups BB_n on n strands, and proved that a blocked torsion has order either 2 or…
A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-K\"onig bound for $n$-dimensional topological stabilizer codes. In this work, we extend…