Related papers: Difference sets and tri-weight linear codes from t…
We prove a conjecture that arose in the context of a subspace enumeration problem over finite fields. We prove, more generally, a bibasic, double-sum identity, which extends a $q$-analogue of the (terminating) binomial theorem.
We study certain triangulated categories of $K$-motives $DK(-)$ over a wide class of base schemes, and define certain "weights" for them. We relate the weights of particular $K$-motives to (negative) homotopy invariant $K$-groups (tensored…
We introduce a new type of reduction of inversive difference polynomials that is associated with a partition of the basic set of automorphisms $\sigma$ and uses a generalization of the concept of effective order of a difference polynomial.…
It is shown that for any positive integer n there exists a subnormal weighted shift on a directed tree whose nth power is closed and densely defined while its (n + 1)th power has trivial domain. Similar result for composition operators in…
Fields in supersymmetric gauge theories may be seen as elements in a spinorial cohomology. We elaborate on this subject, specialising to maximally supersymmetric theories, where the superspace Bianchi identities, after suitable conventional…
The weight hierarchy of a linear code has been an important research topic in coding theory since Wei's original work in 1991. Choosing $ D=\Big\{(x,y)\in \Big(\F_{p^{s_1}}\times\F_{p^{s_2}}\Big)\Big\backslash\{(0,0)\}: f(x)+g(y)=0\Big\}$…
A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…
We give a hyperelliptic formulation of the Ansatz of D'Hoker and Phong. We give an explicit family of binary invariants, one for each genus, that satisfies this hyperelliptic Ansatz. We also prove that this is the unique family of weight…
Let $K$ be a number field generated by a root $\th$ of a monic irreducible trinomial $F(x) = x^n+ax^{m}+b \in \Z[x]$. In this paper, we study the problem of $K$. More precisely, we provide some explicit conditions on $a$, $b$, $n$, and $m$…
We prove that every concatenation of $10$ or more binary squares contains an overlap. The bound $10$ is best possible. In contrast, over a ternary alphabet, there are infinitely long overlap-free words that consist of a concatenation of…
In this article we present a class of codes with few weights arising from special type of linear sets. We explicitly show the weights of such codes, their weight enumerator and possible choices for their generator matrices. In particular,…
In the moduli space of degree d polynomials, the special subvarieties are those cut out by critical orbit relations, and then the special points are the post-critically finite polynomials. It was conjectured that in the moduli space of…
For an infinite family of monogenic trinomials $P(X) = X^3\pm 3rbX-b$ in $\mathbb{Z}\lbrack X\rbrack$, arithmetical invariants of the cubic number field $L = \mathbb{Q}(\theta)$, generated by a zero $\theta$ of $P(X)$, and of its Galois…
In the present paper, we discuss the class of Type III and Type IV codes from the perspectives of neighbors. Our investigation analogously extends the results originally presented by Dougherty [8] concerning the neighbor graph of binary…
Linear complementary dual (LCD) codes are linear codes that intersect with their dual codes trivially. We study the largest minimum weight $d_2(n,k)$ among all binary LCD $[n,k]$ codes and the largest minimum weight $d_3(n,k)$ among all…
We associate to every graph a linear program for packings of vertex disjoint paths. We show that the optimal primal and dual values of the corresponding integer program are the binomial grade and height of the binomial edge ideal of the…
We propose an axiomatic approach towards studying unlikely intersections by introducing the framework of distinguished categories. This includes commutative algebraic groups and mixed Shimura varieties. It allows us to define all basic…
Motivated by the Poisson Dixmier-Moeglin equivalence problem, a systematic study of commutative unitary rings equipped with a {\em biderivation}, namely a binary operation that is a derivation in each argument, is here begun, with an eye…
The well-known middle levels conjecture asserts that for every integer $n\geq 1$, all binary strings of length $2(n+1)$ with exactly $n+1$ many 0s and 1s can be ordered cyclically so that any two consecutive strings differ in swapping the…
Mutual-visibility sets were motivated by visibility in distributed systems and social networks, and intertwine with several classical mathematical areas. Monotone properties of the variety of mutual-visibility sets, and restrictions of such…