Related papers: Duursma's reduced polynomial
McMullen's g-vector is important for simple convex polytopes. This paper postulates axioms for its extension to general convex polytopes. It also conjectures that, for each dimension d, a stated finite calculation gives the formula for the…
Explicit bases for the subfield subcodes of projective Reed-Muller codes over the projective plane and their duals are obtained. In particular, we provide a formula for the dimension of these codes. For the general case over the projective…
A conformal partition function ${\cal P}_n^m(s)$, which arose in the theory of Diophantine equations supplemented with additional restrictions, is concerned with {\it self-dual symmetric polynomials} -- reciprocal ${\sf R}^{\{m\}}_ {S_n}$…
In this paper, we construct a large family of projective linear codes over ${\mathbb F}_{q}$ from the general simplicial complexes of ${\mathbb F}_{q}^m$ via the defining-set construction, which generalizes the results of [IEEE Trans. Inf.…
A linear code of length $n$ over a finite chain ring $R$ with residue field $\F_q$ is a $R$-submodule of $R^n$. A $R$-linear code is a code over $\F_q$ (not necessarily linear) which is the generalized Gray map image of a linear code over…
The c-functions, related to a reductive symmetric space G/H and a fixed representation of a maximal compact subgroup K of G, are shown to satisfy polynomial bounds in imaginary directions.
In this paper, we have introduced the concepts of support distribution and the support enumerator as refinements of the classical weight distribution and weight enumerator respectively, capturing coordinate level activity in linear block…
Let X be a curve over a number field K with genus g>=2, $\pp$ a prime of O_K over an unramified rational prime p>2r, J the Jacobian of X, r=rank J(K), and $\scrX$ a regular proper model of X at $\pp$. Suppose r<g. We prove that…
We characterize Product-MDS pairs of linear codes, i.e.\ pairs of codes $C,D$ whose product under coordinatewise multiplication has maximum possible minimum distance as a function of the code length and the dimensions $\dim C, \dim D$. We…
Archinard studied the curve $C$ over $\mathbb{C}$ associated to an Appell-Lauricella hypergeometric series and differential forms on its desingularization. In this paper, firstly as a generalization of Archinard's results, we describe a…
Let $G$ be a connected reductive group over a finite field $\mathfrak{f}$ of order $q$. When $q$ is small, we make further assumptions on $G$. Then we determine precisely when $G(\mathfrak{f})$ admits irreducible, cuspidal representations…
A lower bound for the Gaussian Q-function is presented in the form of a single exponential function with parametric order and weight. We prove the lower bound by introducing two functions, one related to the Q-function and the other…
Let D be a valued division algebra, finite-dimensional over its center F. Assume D has an unramified splitting field. The paper shows that if D contains a maximal subfield which is Galois over F (i.e. D is a crossed product) then the…
Our main result introduces a new way to characterize two-dimensional finite ball quotients by algebraicity of their Bergman kernels. This characterization is particular to dimension two and fails in higher dimensions, as is illustrated by a…
We associate convex bodies to a wide class of graded G-algebras where G is a connected reductive group. These convex bodies give information about the Hilbert function as well as multiplicities of irreducible representations appearing in…
The generalized Hamming weight of linear codes is a natural generalization of the minimum Hamming distance. They convey the structural information of a linear code and determine its performance in various applications, and have become one…
Some well known results by Haagerup, Jolissaint and de la Harpe may be extended to the setting of a reduced crossed product of a C*-algebra A by a discrete group $G.$ We show that for many discrete groups, which include Gromov's hyperbolic…
Given a graph $G$, we define ${\bf bcg}(G)$ as the minimum $k$ for which $G$ can be contracted to the uniformly triangulated grid $\Gamma_{k}$. A graph class ${\cal G}$ has the SQG${\bf C}$ property if every graph $G\in{\cal G}$ has…
The space of polynomials in two real variables with values in a 2-dimensional irreducible module of a dihedral group is studied as a standard module for Dunkl operators. The one-parameter case is considered (omitting the two-parameter case…
Convex algebraic geometry concerns the interplay between optimization theory and real algebraic geometry. Its objects of study include convex semialgebraic sets that arise in semidefinite programming and from sums of squares. This article…