Related papers: Combinatorial $t$-designs from special polynomials
In the present paper, we construct 3-designs using extended binary quadratic residue codes and their dual codes.
A $t$-$(n,k,\lambda)$ design over $\F_q$ is a collection of $k$-dimensional subspaces of $\F_q^n$, called blocks, such that each $t$-dimensional subspace of $\F_q^n$ is contained in exactly $\lambda$ blocks. Such $t$-designs over $\F_q$ are…
Combinatorial $t$-designs have been an important research subject for many years, as they have wide applications in coding theory, cryptography, communications and statistics. The interplay between coding theory and $t$-designs has been…
In the context of algebraic statistics an experimental design is described by a set of polynomials called the design ideal. This, in turn, is generated by finite sets of polynomials. Two types of generating sets are mostly used in the…
Two-level factorial designs are widely used in industrial experiments. For processes involving \(n\) factors, the construction of designs comprising \(2^n\) and \(2^{n-p}\) factorials, arranged in blocks of size \(2^q\) is investigated. The…
A classical method of constructing a linear code over $\gf(q)$ with a $t$-design is to use the incidence matrix of the $t$-design as a generator matrix over $\gf(q)$ of the code. This approach has been extensively investigated in the…
The aim of this paper is to present a recursive construction of simple t-designs for arbitrary t. The construction is of purely combinatorial nature and it requires finding solutions for the indices of the ingredient designs that satisfy a…
One of the very first results about designs over finite fields, by S. Thomas, is the existence of a cyclic 2-$(n,3,7)$ design over $\mathbb{F}_{2}$ for every integer $n$ coprime with 6. Here, by means of difference methods, we reprove and…
Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, communication…
The aim of the work is to construct new polynomial systems, which are solutions to certain functional equations which generalize the second-order differential equations satisfied by the so called classical orthogonal polynomial families of…
The method of constructing Hermite trigonometric polynomials, which interpolate the values of a certain periodic function and its derivatives up to (including ) the -th ( ) order in nodes of a uniform grid, is considered. The proposed…
We propose several techniques to construct complete permutation polynomials of finite fields by virtue of complete permutations of subfields. In some special cases, any complete permutation polynomials over a finite field can be used to…
Unitary $t$-designs are `good' finite subsets of the unitary group $U(d)$ that approximate the whole unitary group $U(d)$ well. Unitary $t$-designs have been applied in randomized benchmarking, tomography, quantum cryptography and many…
In this paper, we present a method for constructing point primitive block transitive $t$-designs invariant under finite groups. Furthermore, we demonstrate that every point and block primitive $G$-invariant design can be generated using…
Block-transitive Steiner $t$-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory,…
We consider orthogonal polynomials on the surface of a double cone or a hyperboloid of revolution, either finite or infinite in axis direction, and on the solid domain bounded by such a surface and, when the surface is finite, by…
We revisit the classical problem of optimal experimental design (OED) under a new mathematical model grounded in a geometric motivation. Specifically, we introduce models based on elementary symmetric polynomials; these polynomials capture…
This paper is devoted to the explicit construction of optimal designs for discrimination between two polynomial regression models of degree $n-2$ and $n$. In a fundamental paper, Atkinson and Fedorov [Biometrika 62 (1975a) 57--70] proposed…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
In this paper, we introduce a new generating function called $d$-polynomial for the dimensions of $\tau$-tilting modules over a given finite dimensional algebra. Firstly, we study basic properties of $d$-polynomials and show that it can be…