Related papers: Combinatorial t-designs from quadratic functions

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…

In this paper, a construction of complete permutation polynomials over finite fields of even characteristic proposed by Tu et al. recently is generalized in a recursive manner. Besides, several classes of complete permutation polynomials…

We examine combinatorial counting functions with two parameters, $n$ and $q$. For fixed $q$, these functions are (quasi-)polynomial in $n$. As $q$ varies, the degree of this polynomial is itself polynomial in $q$, as are the leading…

The origin of this study is based on not only explicit formulas of finite sums involving higher powers of binomial coefficients, but also explicit evaluations of generating functions for this sums. It should be emphasized that this study…

The research of developing a general methodology for the construction of good nonregular designs has been very active in the last decade. Recent research by Xu and Wong [Statist. Sinica 17 (2007) 1191--1213] suggested a new class of…

A unitary design is a collection of unitary matrices that approximate the entire unitary group, much like a spherical design approximates the entire unit sphere. In this paper, we use irreducible representations of the unitary group to find…

The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…

From an identity connecting a combinatorial sum and Legendre polynomials, we derive closed forms for a number of combinatorial sums. Some of them are obtained via results about the integrals of functions associated with Legendre…

We enhance the approximation capabilities of algebraic polynomials by composing them with homeomorphisms. This composition yields families of functions that remain dense in the space of continuous functions, while enabling more accurate…

In 1952, Littlewood stated a conjecture about the average growth of spherical derivatives of polynomials, and showed that it would imply that for entire function of finite order, "most" preimages of almost all points are concentrated in a…

Planar functions are special functions from a finite field to itself that give rise to finite projective planes and other combinatorial objects. We consider polynomials over a finite field $K$ that induce planar functions on infinitely many…

The aim of this paper is to present a construction of $t$-divisible designs for $t>3$, because such divisible designs seem to be missing in the literature. To this end, tools such as finite projective spaces and their algebraic varieties…

It is known that there is a close analogy between "Euclidean t-designs vs. spherical t-designs" and "Relative t-designs in binary Hamming association schemes vs. combinatorial t-designs". In this paper, we want to prove how much we can…

We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…

Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not incident with the outer face) have degrees larger than three. The planar…

A weighted $t$-design in $\mathbb{R}^d$ is a finite weighted set that exactly integrates all polynomials of degree at most $t$ with respect to a given probability measure. A fundamental problem is to construct weighted $t$-designs with as…

In this paper, we prove the existence of a first-order definition of the polynomial ring over a nonprincipal ultraproduct of finite fields of unbounded cardinalities in its fraction field by a universal-existential formula in the language…

We give a combinatorial description of shape theory using finite topological $T_0$-spaces (finite partially ordered sets). This description may lead to a sort of computational shape theory. Then we introduce the notion of core for inverse…

The so-called polynomial equations play an important role both in algebra and in the theory of functional equations. If the unknown functions in the equation are additive, relatively many results are known. However, even in this case, there…