Related papers: Small and Large Weights in Steinhaus Triangles
This paper is devoted to morphisms killing weights in a range (as defined by the first author) and to objects without these weights (as essentially defined by J. Wildeshaus) in a triangulated category endowed with a weight structure w. We…
A combinatorial problem concerning the maximum size of the (hamming) weight set of an $[n,k]_q$ linear code was recently introduced. Codes attaining the established upper bound are the Maximum Weight Spectrum (MWS) codes. Those $[n,k]_q $…
Given a bivariate weight function defined on the positive quadrant of $\mathbb{R}^2$, we study polynomials in two variables orthogonal with respect to varying measures obtained by special modifications of this weight function. In…
A two-variable generalization of the Big $-1$ Jacobi polynomials is introduced and characterized. These bivariate polynomials are constructed as a coupled product of two univariate Big $-1$ Jacobi polynomials. Their orthogonality measure is…
The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the…
Let $P$ be a partial order on $[n] = \{1,2,\ldots,n\}$, $\mathbb{F}_{q}^n$ be the linear space of $n$-tuples over a finite field $\mathbb{F}_{q}$ and $w$ be a weight on $\mathbb{F}_{q}$. In this paper, we consider metrics on…
Linear codes with few weights have been an interesting subject of study for many years, as these codes have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, linear codes…
We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x…
For the weight function $W_\mu(x) = (1-|x|^2)^\mu$, $\mu > -1$, $\lambda > 0$ and $b_\mu$ a normalizing constant, a family of mutually orthogonal polynomials on the unit ball with respect to the inner product $$ \la f,g \ra = {b_\mu…
In this expository paper we show how one can, in a uniform way, calculate the weight distributions of some well-known binary cyclic codes. The codes are related to certain families of curves, and the weight distributions are related to the…
We consider the distribution of cycles in two models of random permutations, that are related to one another. In the first model, cycles receive a weight that depends on their length. The second model deals with permutations of points in…
A family of $\omega$-circulant balanced weighing matrices with classical parameters is used for the construction of optimal constant weight codes over an alphabet of size $g+1$ and length $n=(q^m -1)/(q-1)$, where $q$ is an odd prime power,…
A theorem by Wolff states that weights defined on a measurable subset of $\mathbb{R}^n$ and satisfying a Muckenhoupt-type condition can be extended into the whole space as Muckenhoupt weights of the same class. We give a complete and…
We derive criteria governing two-weight estimates for multilinear fractional integrals and appropriate maximal functions. The two and one weight problems for multi(sub)linear strong fractional maximal operators are also studied; in…
Due to their important applications to coding theory, cryptography, communications and statistics, combinatorial $t$-designs have been attracted lots of research interest for decades. The interplay between coding theory and $t$-designs has…
Let $A_{m,n}$ be the tensor product of the polynomial algebra in $m$ even variables and the exterior algebra in $n$ odd variables over the complex field $\C$, and the Witt superalgebra $W_{m,n}$ be the Lie superalgebra of superderivations…
This paper is based on the observation that dimension of weight spaces of multi-variable Weyl modules depends polynomially on the highest weight (Conjecture 1). We support this conjecture by various explicit answers for up to three variable…
The problem of rectangle tiling binary arrays is defined as follows. Given an $n \times n$ array $A$ of zeros and ones and a natural number $p$, our task is to partition $A$ into at most $p$ rectangular tiles, so that the maximal weight of…
In this article, we consider weighted sums of generalized polygonal numbers with coefficients $1$ or $2$. We show that for any $m\ge10$, those weighted sums of generalized $m$-gonal numbers represent every non-negative integers if they only…
We give combinatorial criteria for predicting the transcendental weight of Feynman integrals of certain graphs in $\phi^4$ theory. By studying spanning forest polynomials, we obtain operations on graphs which are weight-preserving, and a…