Related papers: A note on the Singleton bounds for codes over fini…
Understanding the limits of list-decoding and list-recovery of Reed-Solomon (RS) codes is of prime interest in coding theory and has attracted a lot of attention in recent decades. However, the best possible parameters for these problems…
We establish birational superrigidity for a large class of singular projective Fano hypersurfaces of index one. In the special case of isolated singularities, our result applies for instance to: (1) hypersurfaces with semi-homogeneous…
Let $X=X(n,q)$ be the set of $n\times n$ Hermitian matrices over $\mathbb{F}_{q^2}$. It is well known that $X$ gives rise to a metric translation association scheme whose classes are induced by the rank metric. We study $d$-codes in this…
We prove an analogue of the celebrated Hall-Higman theorem, which gives a lower bound for the degree of the minimal polynomial of any semisimple element of prime power order $p^{a}$ of a finite classical group in any nontrivial irreducible…
We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…
Let $R$ be a polynomial or power series ring over a field $k$. We study the length of local cohomology modules $H^j_I(R)$ in the category of $D$-modules and $F$-modules. We show that the $D$-module length of $H^j_I(R)$ is bounded by a…
Non-overlapping codes have been studied for almost 60 years. In such a code, no proper, non-empty prefix of any codeword is a suffix of any codeword. In this paper, we study codes in which overlaps of certain specified sizes are forbidden.…
Permutation polynomials have many applications in finite fields theory, coding theory, cryptography, combinatorial design, communication theory, and so on. Permutation binomials of the form $x^{r}(x^{q-1}+a)$ over $\mathbb{F}_{q^2}$ have…
In this paper, several infinite families of codes over the extension of non-unital non-commutative rings are constructed utilizing general simplicial complexes. Thanks to the special structure of the defining sets, the principal parameters…
In several self-coupled quantum field theories when treated in semi-classical limit one obtains solitonic solutions determined by topology of the boundary conditions. Such solutions, e.g. magnetic monopole in unified theories…
List decoding of codes can be seen as the generalization of unique decoding of codes While list decoding over finite fields has been extensively studied, extending these results to more general algebraic structures such as Galois rings…
Recently, codes in the sum-rank metric attracted attention due to several applications in e.g. multishot network coding, distributed storage and quantum-resistant cryptography. The sum-rank analogs of Reed-Solomon and Gabidulin codes are…
A complex spherical code is a finite subset on the unit sphere in $\mathbb{C}^d$. A fundamental problem on complex spherical codes is to find upper bounds for those with prescribed inner products. In this paper, we determine the irreducible…
We study limit cycles in piecewise complex systems with switching manifold $\mathbb{S}^1$. Using M\"obius transformations we establish an equivalence between circular and straight-line discontinuities that preserves periods, stability, and…
We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…
Given a group $G$, we write $g^G$ for the conjugacy class of $G$ containing the element $g$. A theorem of B. H. Neumann states that if $G$ is a group in which all conjugacy classes are finite with bounded size, then the commutator subgroup…
We provide a uniform bound for the index of cohomology classes in $H^i(F, \mu_\ell^{\otimes i-1})$ when $F$ is a semiglobal field (i.e., a one-variable function field over a complete discretely valued field $K$). The bound is given in terms…
For linear recurrence systems, the problem of finding rational solutions is reduced to the problem of computing polynomial solutions by computing a content bound or a denominator bound. There are several bounds in the literature. The…
It is known from work by H. Abels and P. Abramenko that for a classical Fq-group G of rank n the arithemetic lattice G(Fq[t]) of Fq[t]-rational points is of type Fn-1 provided that q is large enough. We show that the statement is true…
We compute the $k$th power-sums (for all $k>0$) over an arbitrary finite unital ring $R$. This unifies and extends the work of Brawley, Carlitz, and Levine for matrix rings [Duke Math. J. 1974], with folklore results for finite fields and…