Related papers: Practical Bijective S-box Design
We establish a bijection between rigged configurations and highest weight elements of a tensor product of Kirillov-Reshetikhin crystals for all nonexceptional types. A key idea for the proof is to embed both objects into bigger sets for…
We estimate the bounds of box-counting dimension of hidden variable fractal interpolation functions (HVFIFs) and hidden variable bivariate fractal interpolation functions (HVBFIFs) with four function contractivity factors and present…
For each positive integer $n$, we construct a bijection between the odd partitions and the distinct partitions of $n$ which extends Bressoud's bijection between the odd-and-distinct partitions of $n$ and the splitting partitions of $n$. We…
For any positive integer $r$, we construct a smooth complex projective rational surface which has at least $r$ real forms not isomorphic over $\mathbb{R}$.
We construct a class of three-Lee-weight and two infinite families of five-Lee-weight codes over the ring $R=\mathbb{F}_2 +v\mathbb{F}_2 +v^2\mathbb{F}_2 +v^3\mathbb{F}_2 +v^4\mathbb{F}_2,$ where $v^5=1.$ The same ring occurs in the quintic…
We prove that every proper subclass of the 321-avoiding permutations that is defined either by only finitely many additional restrictions or is well quasi-ordered has a rational generating function. To do so we show that any such class is…
We classify the nilpotent Lie algebras of real dimension eight and minimal center that admit a complex structure. Furthermore, for every such nilpotent Lie algebra $\mathfrak{g}$, we describe the space of complex structures on…
First we describe the Skjelbred-Sund method for classifying nilpotent Lie algebras. Then we use it to classify 6-dimensional nilpotent Lie algebras over any field of characteristic not 2. The proof of this classification is essentially…
We classify 8-divisible binary linear codes with minimum distance 24 and small length. As an application we consider the codes associated to nodal sextics with 65 ordinary double points.
Cayley hash functions are cryptographic hashes constructed from Cayley graphs of groups. The hash function proposed by Shpilrain and Sosnovski (2016), based on linear functions over a finite field, was proven insecure. This paper shows that…
Strong blocking sets and their counterparts, minimal codes, attracted lots of attention in the last years. Combining the concatenating construction of codes with a geometric insight into the minimality condition, we explicitly provide…
The Burrows-Wheeler transform (BWT) is a permutation whose applications are prevalent in data compression and text indexing. The bijective BWT (BBWT) is a bijective variant of it. Although it is known that the BWT can be constructed in…
Strong external difference families (SEDFs) have applications to cryptography and are rich combinatorial structures in their own right; until now, all SEDFs have been in abelian groups. In this paper, we consider SEDFs in both abelian and…
The Qth-power algorithm produces a useful canonical P-module presentation for the integral closures of certain integral extensions of $P:=\mathbf{F}[x_n,...,x_1]$, a polyonomial ring over the finite field $\mathbf{F}:=\mathbf{Z}_q$ of $q$…
A superimposed code is a collection of binary vectors (codewords) with the property that no vector is contained in the Boolean sum of any $k$ others, enabling unique identification of codewords within any group of $k$. Superimposed codes…
For an arbitrary finite set S of natural numbers greater 1, we construct an integer-valued polynomial f, whose set of lengths in Int(Z) is S. The set of lengths of f is the set of all natural numbers n, such that f has a factorization as a…
The characterizing properties of a proof-theoretical presentation of a given logic may hang on the choice of proof formalism, on the shape of the logical rules and of the sequents manipulated by a given proof system, on the underlying…
We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…
We show that for every sofic chunk $E$ there is a bijective homomorphism $f: E_c \rightarrow E$, where $E_c$ is a chunk of the group of computable permutations of $\mathbb{N}$ so that the approximating morphisms of $E$ can be viewed as…
For a finite dimensional Lie algebra $L$, it is known that $s(L)=\f{1}{2}(n-1)(n-2)+1-\mathrm{dim} M(L)$ is non negative. Moreover, the structure of all finite nilpotent Lie algebras is characterized when $s(L)=0,1$ in \cite{ni,ni4}. In…