English
Related papers

Related papers: Symmetric bilinear forms over finite fields with a…

200 papers

In this note we develop a systematic combinatorial definition for constructed earlier supersymmetric polynomial families. These polynomial families generalize canonical Schur, Jack and Macdonald families so that the new polynomials depend…

High Energy Physics - Theory · Physics 2024-10-25 Dmitry Galakhov , Alexei Morozov , Nikita Tselousov

This paper defines and investigates nonsymmetric Macdonald polynomials with values in an irreducible module of the Hecke algebra of type $A_{N-1}$. These polynomials appear as simultaneous eigenfunctions of Cherednik operators. Several…

Combinatorics · Mathematics 2011-06-07 C. F. Dunkl , J. -G. Luque

In this work we show that given a connectivity graph $G$ of a $[[n,k,d]]$ quantum code, there exists $\{K_i\}_i, K_i \subset G$, such that $\sum_i |K_i|\in \Omega(k), \ |K_i| \in \Omega(d)$, and the $K_i$'s are $\tilde{\Omega}(…

Information Theory · Computer Science 2023-09-29 Nouédyn Baspin

Let $F$ be a field and let $F^{r\times s}$ denote the space of $r\times s$ matrices over $F$. Given equinumerous subsets $\mathcal{A}=\{A_i\mid i \in I\}\subseteq F^{r\times r}$ and $\mathcal{B}=\{B_i\mid i\in I\}\subseteq F^{s\times s}$ we…

Combinatorics · Mathematics 2018-03-02 S. P. Glasby , Cheryl E. Praeger

An explicit construction of a family of binary LDPC codes called LU(3,q), where q is a power of a prime, was recently given. A conjecture was made for the dimensions of these codes when q is odd. The conjecture is proved in this note. The…

Information Theory · Computer Science 2007-12-04 Peter Sin , Qing Xiang

A class of optimal three-weight cyclic codes of dimension 3 over any finite field was presented by Vega [Finite Fields Appl., 42 (2016) 23-38]. Shortly thereafter, Heng and Yue [IEEE Trans. Inf. Theory, 62(8) (2016) 4501-4513] generalized…

Information Theory · Computer Science 2021-07-12 Gerardo Vega , Félix Hernández

The \emph{$q,t$-Catalan numbers} $C_n(q,t)$ are polynomials in $q$ and $t$ that reduce to the ordinary Catalan numbers when $q=t=1$. These polynomials have important connections to representation theory, algebraic geometry, and symmetric…

Combinatorics · Mathematics 2019-11-01 Kyungyong Lee , Li Li , Nicholas A. Loehr

Certain simplicial complexes are used to construct a subset $D$ of $\mathbb{F}_{2^n}^m$ and $D$, in turn, defines the linear code $C_{D}$ over $\mathbb{F}_{2^n}$ that consists of $(v\cdot d)_{d\in D}$ for $v\in \mathbb{F}_{2^n}^m$. Here we…

Information Theory · Computer Science 2022-04-19 Vidya Sagar , Ritumoni Sarma

We demonstrate propagation rules of subsystem code constructions by extending, shortening and combining given subsystem codes. Given an $[[n,k,r,d]]_q$ subsystem code, we drive new subsystem codes with parameters $[[n+1,k,r,\geq d]]_q$,…

Quantum Physics · Physics 2008-11-11 Salah A. Aly

In this paper some properties of the irreducible multiplets of representation for the N = (p, q) - extended supersymmetry in one dimension are discussed. Essentially two results are here presented. At first a peculiar property of the one…

High Energy Physics - Theory · Physics 2009-10-31 A. Pashnev , F. Toppan

Polycyclic codes offer a natural generalization of cyclic codes and provide a broader algebraic framework for constructing linear codes with good parameters. In this paper, we study binary polycyclic codes associated with powers of…

Information Theory · Computer Science 2026-05-13 Sujata Bansal , Pramod Kumar Kewat

Maximum rank distance codes denoted MRD-codes are the equivalent in rank metric of MDS-codes. Given any integer $q$ power of a prime and any integer $n$ there is a family of MRD-codes of length $n$ over $\FF{q^n}$ having polynomial-time…

Information Theory · Computer Science 2007-07-13 E. M. Gabidulin , P. Loidreau

The permutation groups of cyclic codes are widely applicable in determining the weight distribution of codes, decoding theory and various other areas. In this paper, by employing two distinct matrix representations, we can relate cyclic…

Information Theory · Computer Science 2026-05-26 Junjie Huang , Jicheng Ma , Chang-An Zhao

A quadratic form f is said to have semigroup property if its values at points of the integer lattice form a semigroup under multiplication. A problem of V. Arnold is to describe all binary integer quadratic forms with semigroup property. If…

Number Theory · Mathematics 2007-05-23 Francesca Aicardi , Vladlen Timorin

In this note, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi group codes, that is, as linear codes allowing a group of permutation automorphisms…

Information Theory · Computer Science 2021-11-11 Martino Borello , Wolfgang Willems

The use of skew polynomial rings allows to endow linear codes with cyclic structures which are not cyclic in the classical (commutative) sense. Whenever these skew cyclic structures are carefully chosen, some control over the Hamming…

Information Theory · Computer Science 2018-07-23 José Gómez-Torrecillas , Gabriel Navarro , F. J. Lobillo , Alessandro Neri

Baranyai's theorem is a well-known theorem in the theory of hypergraphs. A corollary of this theorem says that one can partition the family of all $u$-subsets of an $n$-element set into ${n-1\choose u-1}$ sub-families such that each…

Information Theory · Computer Science 2013-03-04 Liang Feng Zhang

We develop a theory of two-parameter quantum polynomial functors. Similar to how (strict) polynomial functors give a new interpretation of polynomial representations of the general linear groups $\operatorname{GL}_n$, the two-parameter…

Representation Theory · Mathematics 2020-01-24 Valentin Buciumas , Hankyung Ko

We develop a wide general theory of bilinear bi-parameter singular integrals $T$. First, we prove a dyadic representation theorem starting from $T1$ assumptions and apply it to show many estimates, including $L^p \times L^q \to L^r$…

Classical Analysis and ODEs · Mathematics 2020-05-20 Kangwei Li , Henri Martikainen , Emil Vuorinen

Any homogeneous polynomial $P(x, y, z)$ of degree $d$, being restricted to a unit sphere $S^2$, admits essentially a unique representation of the form $\lambda_0 + \sum_{k = 1}^d \lambda_k [\prod_{j = 1}^k L_{kj}]$, where $L_{kj}$'s are…

Complex Variables · Mathematics 2007-05-23 Gabriel Katz