Related papers: The equivalent identities of the MacWilliams ident…
Using a specific form of the triple product identity, polygonal number identities are stated. Further number identities are examined that can be considered identities related to modular sets of numbers. The identities can be used to give…
In this paper, a new identity for convex functions is derived. A consequence of the identity is that we can derive new estimates for the remainder term of the midpoint, trapezoid, and Simpson formulae for functions whose derivatives in…
We present an algorithm to express Wilson lines that are defined on piecewise linear paths in function of their individual segments, reducing the number of diagrams needed to be calculated. The important step lies in the observation that…
The number of partitions of n into parts divisible by a or b equals the number of partitions of n in which each part and each difference of two parts is expressible as a non-negative integer combination of a or b. This generalizes…
We give three elementary proofs of a nice equality of definite integrals, which arises from the theory of bivariate hypergeometric functions, and has connections with irrationality proofs in number theory. We furthermore provide a…
Motivated by the resemblance of a multivariate series identity and a finite analogue of Euler's pentagonal number theorem, we study multiple extensions of the latter formula. In a different direction we derive a common extension of this…
Additive codes have attracted considerable attention for their potential to outperform linear codes. However, distinguishing strictly additive codes from those that are equivalent to linear codes remains a fundamental challenge. To resolve…
In a Hom-Malcev algebra an identity, equivalent to the Hom-Malcev identity, is found.
We present a different combinatorial interpretations of Lucas and Gibonacci numbers. Using these interpretations we prove several new identities, and simplify the proofs of several known identities. Some open problems are discussed towards…
We show that MIF (mixed-identity-free) linear groups are sharply MIF and linearly MIF. Along the way we provide a self contained proof of the strong approximation theorem, and a new (probabilistic) variant of the super approximation…
Codes over various metrics such as Rosenbloom-Tsfasman (RT), Lee, etc. have been considered. Recently, codes over poset metrics have been studied. Poset metric is a great generalization of many metrics especially the well-known ones such as…
In this note, after recalling a proof of the Macdonald identities for untwisted affine root systems, we derive the Macdonald identities for twisted affine root systems.
We describe a method, based on the theory of Macdonald-Koornwinder polynomials, for proving bounded Littlewood identities. Our approach provides an alternative to Macdonald's partial fraction technique and results in the first examples of…
In this paper, we clarified the relationship between continued fractions, determinants, and identities, making it easier to apply these methods systematically in other settings. In particular, we studied finite continued fractions from the…
The equivalence of multidimensional systems is closely related to the reduction of multivariate polynomial matrices, with the Smith normal form of matrices playing a key role. So far, the problem of reducing multivariate polynomial matrices…
We consider certain functional identities on the matrix algebra $M_n$ that are defined similarly as the trace identities, except that the "coefficients" are arbitrary polynomials, not necessarily those expressible by the traces. The main…
Pomset block metric is a generalization of pomset metric. In this paper, we define weight enumerator of linear block codes in pomset metric over $\mathbb{Z}_m$ and establish MacWilliams type identities for linear block codes with respect to…
We initiate the study of the duality theory of locally recoverable codes, with a focus on the applications. We characterize the locality of a code in terms of the dual code, and introduce a class of invariants that refine the classical…
In this paper we will discuss isometries and strong isometries for convolutional codes. Isometries are weight-preserving module isomorphisms whereas strong isometries are, in addition, degree-preserving. Special cases of these maps are…
Burst errors are very common in practice. There have been many designs in order to control and correct such errors. Recently, a new class of byte error control codes called spotty byte error control codes has been specifically designed to…