Related papers: A construction of (t,s)-sequences with finite-row …
Let A_{R,q} denote a family of covering codes, in which the covering radius R and the size q of the underlying Galois field are fixed, while the code length tends to infinity. In this paper, infinite sets of families A_{R,q}, where R is…
Let $R$ be a commutative ring and let $n \geq 1.$ We study $\Gamma(s)$, the generating function and Ann$(s)$, the ideal of characteristic polynomials of $s$, an $n$--dimensional sequence over $R$. We express $f(X_1,\ldots,X_n) \cdot…
As countless examples show, it can be fruitful to study a sequence of complicated objects all at once via the formalism of generating functions. We apply this point of view to the homology and combinatorics of orbit configuration spaces:…
The classes of $(u,m,{\bf e},s)$-nets and $(u,{\bf e},s)$-sequences were recently introduced by Tezuka, and in a slightly more restrictive form by Hofer and Niederreiter. We study propagation rules for these point sets, which state how one…
In many cases one may encounter an integral which is of $q$-Mellin--Barnes type. These integrals are easily evaluated using theorems which have a long history dating back to Slater, Askey, Gasper, Rahman and others. We derive some…
Row-column factorial designs that provide unconfounded estimation of all main effects and the maximum number of two-factor interactions (2fi's) are called 2fi-optimal. This issue has been paid great attention recently for its wide…
In this paper, several infinite families of codes over the extension of non-unital non-commutative rings are constructed utilizing general simplicial complexes. Thanks to the special structure of the defining sets, the principal parameters…
In this paper we present a new family of discrete sequences having "random like" uniformly decaying auto-correlation properties. The new class of infinite length sequences are higher order chirps constructed using irrational numbers.…
Given an alphabet $S$, we consider the size of the subsets of the full sequence space $S^{\rm {\bf Z}}$ determined by the additional restriction that $x_i\not=x_{i+f(n)},\ i\in {\rm {\bf Z}},\ n\in {\rm {\bf N}}.$ Here $f$ is a positive,…
We present combinatorial and analytical results concerning a Sheffer sequence with a generating function of the form $G(x,z)=Q(z)^{x}Q(-z)^{1-x}$, where $Q$ is a quadratic polynomial with real zeros. By using the properties of Riordan…
A generalization of the Heisenberg algebra has been recently constructed. This generalized algebra has a characteristic function which depends on one of its generators. When this function is linear, $qJ_0+s$, it is possible to construct a…
The $G$-graph $\Gamma(G,S)$ is a graph from the group $G$ generated by $S\subseteq G$, where the vertices are the right cosets of the cyclic subgroups $\langle s \rangle, s\in S$ with $k$-edges between two distinct cosets if there is an…
For an integer $M\geq 2$ and a finite group $G$, an element $\alpha\in G$ is called an $M$-th power if it satisfies $A^M=\alpha$ for some $A\in G$. In this article, we will deal with the case when $G$ is finite symplectic or orthogonal…
We consider the set of affine permutations that avoid a fixed permutation pattern. Crites has given a simple characterization for when this set is infinite. We find the generating series for this set using the Coxeter length statistic and…
Given integers s,t, define a function phi_{s,t} on the space of all formal series expansions by phi_{s,t} (sum a_n x^n) = sum a_{sn+t} x^n. For each function phi_{s,t}, we determine the collection of all rational functions whose Taylor…
We show that all invertible $n \times n$ matrices over any finite field $\mathbb{F}_q$ can be generated in a Gray code fashion. More specifically, there exists a listing such that (1) each matrix appears exactly once, and (2) two…
Using a general $q$-series expansion, we derive some nontrivial $q$-formulas involving many infinite products. A multitude of Hecke--type series identities are derived. Some general formulas for sums of any number of squares are given. A…
We introduce a class of finite tight frames called prime tight frames and prove some of their elementary properties. In particular, we show that any finite tight frame can be written as a union of prime tight frames. We then characterize…
Let $q=p^n$ be an odd prime power and let $\mathbb{F}_q$ be the finite field with $q$ elements. Let $\widehat{\mathbb{F}_q^{\times}}$ be the group of all multiplicative characters of $\mathbb{F}_q$ and let $\chi$ be a generator of…
The mds (maximum distance separable) conjecture claims that a nontrivial linear mds $[n,k]$ code over the finite field $GF(q)$ satisfies $n \leq (q + 1)$, except when $q$ is even and $k = 3$ or $k = q- 1$ in which case it satisfies $n \leq…