Related papers: Nonexistence of Exceptional 5-class Association Sc…

In his study of Ramanujan-Sato type series for $1/\pi$, Sun introduced a sequence of polynomials $S_n(q)$ as given by $$S_n(q)=\sum\limits_{k=0}^n{n\choose k}{2k\choose k}{2(n-k)\choose n-k}q^k,$$ and he conjectured that the polynomials…

An infinite summation formula of Hall-Littlewood polynomials due to Kawanaka is generalized to a finite summation formula, which implies, as applications, twelve multiple q-identities of Rogers-Ramanujan type.

This paper investigates whether or not polynomials that are irreducible over $\mathbb{Q}$ and $\mathbb{Z}$ can remain irreducible under substitution by all quadratic polynomials. It answers this question in the negative in the degree 2 and…

It is shown that Suzuki-Ree groups can be easily defined by means of comparing two fundamental representations of the ambient Chevalley group in characteristic 2 or 3. This eliminates the distinction between the Suzuki-Ree groups over…

Association schemes play an important role in algebraic combinatorics and have important applications in coding theory, graph theory and design theory. The methods to construct association schemes by using bent functions have been…

In this paper, the association scheme defined on the flags of a finite generalized quadrangle is considered. All possible fusions of this scheme are listed, and a full description for those of classes 2 and 3 is given. Furthermore, it is…

The Lloyd Theorem of (Sol\'e, 1989) is combined with the Schwartz-Zippel Lemma of theoretical computer science to derive non-existence results for perfect codes in the Lee metric, NRT metric, mixed Hamming metric, and for the sum-rank…

The structure of binary self-dual codes invariant under the action of a cyclic group of order $pq$ for odd primes $p\neq q$ is considered. As an application we prove the nonexistence of an extremal self-dual $[96, 48, 20]$ code with an…

Classes of simple polynomial and simple trigonometric splines given by Fourier series are considered. It is shown that the class of simple trigonometric splines includes the class of simple polynomial splines. For some parameter values, the…

The Jacobi polynomial has been advocated by many authors as a useful tool to evolve non-singlet structure functions to higher $Q^2$. In this work, it is found that the convergence of the polynomial sum is not absolute, as there is always a…

Algebraic and analytic aspects of self-adjoint operators of order four or more with polynomial coefficients are investigated. As a consequence, a systematic way of constructing such operators is given. The procedure is applied to obtain…

Let $\mathscr{Q}(m,q)$ and $\mathscr{S}(m,q)$ be the sets of quadratic forms and symmetric bilinear forms on an $m$-dimensional vector space over $\mathbb{F}_q$, respectively. The orbits of $\mathscr{Q}(m,q)$ and $\mathscr{S}(m,q)$ under a…

Given a symmetric polynomial $P$ in $2n$ variables, there exists a unique symmetric polynomial $Q$ in $n$ variables such that \[ P(x_1,\ldots,x_n,x_1^{-1},\ldots,x_n^{-1}) =Q(x_1+x_1^{-1},\ldots,x_n+x_n^{-1}). \] We denote this polynomial…

We prove that if X is a spherical t-design and s-distance set with $t\geq 2s-3$, then X has the structure of Q-polynomial association scheme of class s. Also, we describe the parameters of the association scheme.

We give an excess theorem for spherical 2-designs. This theorem is a dual version of the spectral excess theorem for graphs, which gives a characterization of distance-regular graphs, among regular graphs in terms of the eigenvalues and the…

In this paper, the existence of perfect and quasi-perfect splitter sets in finite abelian groups is studied, motivated by their application in coding theory for flash memory storage. For perfect splitter sets we view them as splittings of…

The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…

Pourchet proved in 1971 that every nonnegative univariate polynomial with rational coefficients is a sum of five or fewer squares. Nonetheless, there are no known algorithms for constructing such a decomposition. The sole purpose of the…

We consider an amalgam of groups constructed from fusion systems for different odd primes p and q. This amalgam contains a self-normalizing cyclic subgroup of order pq and isolated elements of order p and q.

In this article we prove in the main theorem that, there is a bijection between the isomorphism classes of a certain type of real hyperplane arrangements on the one hand, and the antipodal pairs of convex cones of an associated…