English
Related papers

Related papers: On McMillan's theorem about uniquely decipherable …

200 papers

We give a criterion for the Kac conjecture asserting that the free term of the polynomial counting the absolutely indecomposable representations of a quiver over a finite field of given dimension coincides with the corresponding root…

Representation Theory · Mathematics 2007-08-09 Sergey Mozgovoy

By a re-examination of MacMahon's original proof of his celebrated theorem on the distribution of the major indices over permutations, we give a reformulation of his argument in terms of the structure of labeled partitions. In this…

Combinatorics · Mathematics 2007-05-23 William Y. C. Chen , Deheng Xu

It is shown here that a strengthening of Wallach's Unentangled Gleason Theorem can be obtained by applying results of the present authors on generalised Gleason theorems for quantum multi-measures arising from investigations of quantum…

Quantum Physics · Physics 2007-05-23 Oliver Rudolph , J. D. M. Wright

A code of the natural numbers is a uniquely-decodable binary code of the natural numbers with non-decreasing codeword lengths, which satisfies Kraft's inequality tightly. We define a natural partial order on the set of codes, and show how…

Logic in Computer Science · Computer Science 2015-07-01 Yuval Filmus

The main theorem in this paper is a far-reaching generalization of Gleason's theorem on the weight enumerators of codes which applies to arbitrary-genus weight enumerators of self-dual codes defined over a large class of finite rings and…

Number Theory · Mathematics 2007-07-16 Gabriele Nebe , E. M. Rains , N. J. A. Sloane

We give a combinatorial proof of the factorization formula of modified Macdonald polynomials when the parameter t is specialized at a primitive root of unity. Our proof is restricted to the special case of partitions with 2 columns. We…

Combinatorics · Mathematics 2008-03-18 Francois Descouens , Hideaki Morita , Yasuhide Numata

In this note, the polar decomposition of binary fields of even extension degree is used to reduce the evaluation of the Walsh transform of binomial Boolean functions to that of Gauss sums. In the case of extensions of degree four times an…

Number Theory · Mathematics 2016-08-22 Jean-Pierre Flori

The adjacency matrix associated with a convolutional code collects in a detailed manner information about the weight distribution of the code. A MacWilliams Identity Conjecture, stating that the adjacency matrix of a code fully determines…

Information Theory · Computer Science 2007-07-13 Heide Gluesing-Luerssen , Gert Schneider

Let $\nu$ be a valuation of arbitrary rank on the polynomial ring $K[x]$ with coefficients in a field $K$. We prove comparison theorems between MacLane-Vaqui\'e key polynomials for valuations $\mu\le\nu$ and abstract key polynomials for…

In the large rank limit, for any nonexceptional affine algebra, the graded branching multiplicities known as one-dimensional sums, are conjectured to have a simple relationship with those of type A, which are known as generalized Kostka…

Combinatorics · Mathematics 2007-05-23 Mark Shimozono

A theorem is proved on the uniform estimation of the residual term of the asymptotic expansion with respect to a small parameter of the solution of the initial problem for a singularly perturbed differential operator weakly nonlinear…

Analysis of PDEs · Mathematics 2022-11-14 A. Nesterov , A. Zaborsciy

The continuity of the inverse Klain map is investigated and the class of centrally symmetric convex bodies at which every valuation depends continuously on its Klain function is characterized. Among several applications, it is shown that…

Metric Geometry · Mathematics 2019-12-19 Lukas Parapatits , Thomas Wannerer

In this paper we extend the notion of Melham sum to the Pell and Pell-Lucas sequences. While the proofs of general statements rely on the binomial theorem, we prove some spacial cases by the known Pell identities. We also give extensions of…

Combinatorics · Mathematics 2015-08-21 Ivica Martinjak , Iva Vrsaljko

Jeffery's 1861 computations using finite difference calculus are resurrected and extended from forward differences to general delta operators and used to neatly prove theorems in the Rota--Mullins theory of polynomials of binomial type…

Combinatorics · Mathematics 2013-07-19 J. S. Dowker

In this paper, the MacWilliams theorem is stated for codes over finite field with four-dimensional modulo metrics.

Information Theory · Computer Science 2014-10-21 Murat Guzeltepe , Mehmet Ozen

We prove a distribution-theoretic conjecture of Robert Coleman, thereby also obtaining an explicit description of the complete set of Euler systems for the multiplicative group over Q.

Number Theory · Mathematics 2021-04-21 David Burns , Alexandre Daoud , Soogil Seo

We give some extensions of Mercer's theorem to continuous Carleman kernels inducing unbounded integral operators.

Functional Analysis · Mathematics 2007-05-23 I. M. Novitskii , M. A. Romanov

Let S_d be the symmetric group on d letters and let k be a field of characteristic p>2. Tensoring an irreducible S_d module with the sign representation defines an involution on the p-regular partitions of d. It is suprisingly difficult to…

Group Theory · Mathematics 2007-05-23 J. Brundan , J. Kujawa

We consider the zeros distributions on the derivatives of difference polynomials of meromorphic functions, and present some results which can be seen as the discrete analogues of Hayman conjecture \cite{hayman1}, also partly answer the…

Complex Variables · Mathematics 2011-07-06 Kai Liu , Xin-Ling Liu , Ting-Bin Cao

We prove a multiple recurrence result for arbitrary measure-preserving transformations along polynomials in two variables of the form $m+p_i(n)$, with rationally independent $p_i$'s with zero constant term. This is in contrast to the single…

Dynamical Systems · Mathematics 2019-02-20 Nikos Frantzikinakis , Pavel Zorin-Kranich