Searcharxiv⌕ Search

arXiv subjects

Shuxing Li

Publications and source records attributed to Shuxing Li.

At least 19 recordsLinked to original sources
arXiv2026

The generalized covering radii of Melas codes

The generalized covering radii have recently emerged as fundamental parameters of linear codes with applications to database linear querying. In this paper, we study the generalized covering radii $\rho_t(M(m,q))$ of Melas codes $M(m,q)$ over any finite field $\mathbb{F}_q$. We determine $\rho_2(M(m,q))$ for all $q$, and for a general $t \ge 3$, we prove that $\rho_t(M(m,q)) \in \left\{2t,2t+1\right\}$ for $q \in \{2,3\}$ and $\rho_t(M(m,q))=2t$ for $q \ge 4$ whenever $m$ is sufficiently large. These results extend recent work on the covering radius of Melas codes.

cs.IT↗
arXiv2025

Generalized additive bases and difference bases for Cartesian product of finite abelian groups

For a finite group $G$ and positive integer $g$, a $g$-additive basis is a subset of $G$ whose pairwise sums cover each element of $G$ at least $g$ times, with $g$-difference bases defined similarly using pairwise differences. While prior work focused on $1$-additive and $1$-difference bases, recent works of Kravitz and Schmutz--Tait explored $g$-additive and $g$-difference bases in finite abelian groups. This paper investigates such bases in $G^n$, the Cartesian product of a finite abelian group $G$. We construct $g$-additive and $g$-difference bases in $G^n$, which lead to asymptotically sharp upper bounds on the minimal sizes of such bases. Our proofs draw on ideas from additive combinatorics and combinatorial design theory.

math.CO↗
arXiv2025

Cyclotomic construction of $\lambda$-fold near-factorizations of cyclic groups

The study of near-factorizations of finite groups dates back to the 1950s. Recently, this topic has attracted renewed attention, and the concept has been extended to $\lambda$-fold near-factorizations, in which each non-identity group element appears exactly $\lambda \ge 1$ times. This paper presents a cyclotomic construction of $\lambda$-fold near-factorizations in the cyclic group $\mathbb{F}_p$, where $p = 4n^4 + 12n^2 + 1$ is prime for $n \ge 1$.

math.CO↗
arXiv2025

$\lambda$-fold near-factorizations of groups

We initiate the study of $\lambda$-fold near-factorizations of groups with $\lambda > 1$. While $\lambda$-fold near-factorizations of groups with $\lambda = 1$ have been studied in numerous papers, this is the first detailed treatment for $\lambda > 1$. We establish fundamental properties of $\lambda$-fold near-factorizations and introduce the notion of equivalence. We prove various necessary conditions of $\lambda$-fold near-factorizations, including upper bounds on $\lambda$. We present three constructions of infinite families of $\lambda$-fold near-factorizations, highlighting the characterization of two subfamilies of $\lambda$-fold near-factorizations. We discuss a computational approach to $\lambda$-fold near-factorizations and tabulate computational results for abelian groups of small order.

math.GR↗
arXiv2025

Strongly Regular Graphs with Generalized Denniston and Dual Generalized Denniston Parameters

We construct two families of strongly regular Cayley graphs, or equivalently, partial difference sets, based on elementary abelian groups. The parameters of these two families are generalizations of the Denniston and the dual Denniston parameters, in contrast to the well known Latin square type and negative Latin square type parameters. The two families unify and subsume a number of existing constructions which have been presented in various contexts such as strongly regular graphs, partial difference sets, projective sets, and projective two-weight codes, notably including Denniston's seminal construction concerning maximal arcs in classical projective planes with even order. Our construction generates further momentum in this area, which recently saw exciting progress on the construction of the analogue of the famous Denniston partial difference sets in odd characteristic.

math.CO↗
arXiv2023

Group rings and character sums: tricks of the trade

The combination of the group ring setting with the methods of character theory allows an elegant and powerful analysis of various combinatorial structures, via their character sums. These combinatorial structures include difference sets, relative difference sets, partial difference sets, bent functions, hyperplanes, spreads, and LP-packings. However, the literature on these techniques often relies on peculiar conventions and implicit understandings that are not always readily accessible to those new to the subject. While there are many excellent advanced sources describing these techniques, we are not aware of an expository paper at the introductory level that articulates the commonly used ``tricks of the trade''. We attempt to remedy this situation by means of illustrative examples, explicit discussion of conventions, and instructive proofs of fundamental results.

math.HO↗
arXiv2023

Constructions and restrictions for balanced splittable Hadamard matrices

A Hadamard matrix is balanced splittable if some subset of its rows has the property that the dot product of every two distinct columns takes at most two values. This definition was introduced by Kharaghani and Suda in 2019, although equivalent formulations have been previously studied using different terminology. We collate previous results phrased in terms of balanced splittable Hadamard matrices, real flat equiangular tight frames, spherical two-distance sets, and two-distance tight frames. We use combinatorial analysis to restrict the parameters of a balanced splittable Hadamard matrix to lie in one of several classes, and obtain strong new constraints on their mutual relationships. An important consideration in determining these classes is whether the strongly regular graph associated with the balanced splittable Hadamard matrix is primitive or imprimitive. We construct new infinite families of balanced splittable Hadamard matrices in both the primitive and imprimitive cases. A rich source of examples is provided by packings of partial difference sets in elementary abelian 2-groups, from which we construct Hadamard matrices admitting a row decomposition so that the balanced splittable property holds simultaneously with respect to every union of the submatrices of the decomposition.

math.CO↗
arXiv2022

A group-based structure for perfect sequence covering arrays

An $(n,k)$-perfect sequence covering array with multiplicity $λ$, denoted PSCA$(n,k,λ)$, is a multiset whose elements are permutations of the sequence $(1,2, \dots, n)$ and which collectively contain each ordered length $k$ subsequence exactly $λ$ times. The primary objective is to determine for each pair $(n,k)$ the smallest value of $λ$, denoted $g(n,k)$, for which a PSCA$(n,k,λ)$ exists; and more generally, the complete set of values $λ$ for which a PSCA$(n,k,λ)$ exists. Yuster recently determined the first known value of $g(n,k)$ greater than 1, namely $g(5,3)=2$, and suggested that finding other such values would be challenging. We show that $g(6,3)=g(7,3)=2$, using a recursive search method inspired by an old algorithm due to Mathon. We then impose a group-based structure on a perfect sequence covering array by restricting it to be a union of distinct cosets of a prescribed nontrivial subgroup of the symmetric group $S_n$. This allows us to determine the new results that $g(7,4)=2$ and $g(7,5) \in \{2,3,4\}$ and $g(8,3) \in \{2,3\}$ and $g(9,3) \in \{2,3,4\}$. We also show that, for each $(n,k) \in \{ (5,3), (6,3), (7,3), (7,4) \}$, there exists a PSCA$(n,k,λ)$ if and only if $λ\ge 2$; and that there exists a PSCA$(8,3,λ)$ if and only if $λ\ge g(8,3)$.

math.CO↗
arXiv2021

Packings of partial difference sets

A packing of partial difference sets is a collection of disjoint partial difference sets in a finite group $G$. This configuration has received considerable attention in design theory, finite geometry, coding theory, and graph theory over many years, although often only implicitly. We consider packings of certain Latin square type partial difference sets in abelian groups having identical parameters, the size of the collection being either the maximum possible or one smaller. We unify and extend numerous previous results in a common framework, recognizing that a particular subgroup reveals important structural information about the packing. Identifying this subgroup allows us to formulate a recursive lifting construction of packings in abelian groups of increasing exponent, as well as a product construction yielding packings in the direct product of the starting groups. We also study packings of certain negative Latin square type partial difference sets of maximum possible size in abelian groups, all but one of which have identical parameters, and show how to produce such collections using packings of Latin square type partial difference sets.

math.CO↗
arXiv2020

TLeague: A Framework for Competitive Self-Play based Distributed Multi-Agent Reinforcement Learning

Competitive Self-Play (CSP) based Multi-Agent Reinforcement Learning (MARL) has shown phenomenal breakthroughs recently. Strong AIs are achieved for several benchmarks, including Dota 2, Glory of Kings, Quake III, StarCraft II, to name a few. Despite the success, the MARL training is extremely data thirsty, requiring typically billions of (if not trillions of) frames be seen from the environment during training in order for learning a high performance agent. This poses non-trivial difficulties for researchers or engineers and prevents the application of MARL to a broader range of real-world problems. To address this issue, in this manuscript we describe a framework, referred to as TLeague, that aims at large-scale training and implements several main-stream CSP-MARL algorithms. The training can be deployed in either a single machine or a cluster of hybrid machines (CPUs and GPUs), where the standard Kubernetes is supported in a cloud native manner. TLeague achieves a high throughput and a reasonable scale-up when performing distributed training. Thanks to the modular design, it is also easy to extend for solving other multi-agent problems or implementing and verifying MARL algorithms. We present experiments over StarCraft II, ViZDoom and Pommerman to show the efficiency and effectiveness of TLeague. The code is open-sourced and available at https://github.com/tencent-ailab/tleague_projpage

cs.LG↗
arXiv2020

Intersection distribution, non-hitting index and Kakeya sets in affine planes

We propose the concepts of intersection distribution and non-hitting index, which can be viewed from two related perspectives. The first one concerns a point set $S$ of size $q+1$ in the classical projective plane $PG(2,q)$, where the intersection distribution of $S$ indicates the intersection pattern between $S$ and the lines in $PG(2,q)$. The second one relates to a polynomial $f$ over a finite field $\mathbb{F}_q$, where the intersection distribution of $f$ records an overall distribution property of a collection of polynomials $\{f(x)+cx \mid c \in \mathbb{F}_q\}$. These two perspectives are closely related, in the sense that each polynomial produces a $(q+1)$-set in a canonical way and conversely, each $(q+1)$-set with certain property has a polynomial representation. Indeed, the intersection distribution provides a new angle to distinguish polynomials over finite fields, based on the geometric property of the corresponding $(q+1)$-sets. Among the intersection distribution, we identify a particularly interesting quantity named non-hitting index. For a point set $S$, its non-hitting index counts the number of lines in $PG(2,q)$ which do not hit $S$. For a polynomial $f$ over a finite field $\mathbb{F}_q$, its non-hitting index gives the summation of the sizes of $q$ value sets $\{f(x)+cx \mid x \in \mathbb{F}_q\}$, where $c \in \mathbb{F}_q$. We derive bounds on the non-hitting index and show that the non-hitting index contains much information about the corresponding set and the polynomial. More precisely, using a geometric approach, we show that the non-hitting index is sufficient to characterize the corresponding point set and the polynomial when it is close to the lower and upper bounds. Moreover, we employ an algebraic approach to derive the intersection distribution of several families of point sets and polynomials, and compute the sizes of related Kakeya sets in affine planes.

math.CO↗
arXiv2020

Vanishing Flats: A Combinatorial Viewpoint on the Planarity of Functions and Their Application

For a function $f$ from $\mathbb{F}_2^n$ to $\mathbb{F}_2^n$, the planarity of $f$ is usually measured by its differential uniformity and differential spectrum. In this paper, we propose the concept of vanishing flats, which supplies a combinatorial viewpoint on the planarity. First, the number of vanishing flats of $f$ can be regarded as a measure of the distance between $f$ and the set of almost perfect nonlinear functions. In some cases, the number of vanishing flats serves as an "intermediate" concept between differential uniformity and differential spectrum, which contains more information than differential uniformity, however less than the differential spectrum. Secondly, the set of vanishing flats forms a combinatorial configuration called partial quadruple system, since it convey detailed structural information about $f$. We initiate this study by considering the number of vanishing flats and the partial quadruple systems associated with monomials and Dembowski-Ostrom polynomials. In addition, we present an application of vanishing flats to the partition of a vector space into disjoint equidimensional affine spaces. We conclude the paper with several further questions and challenges.

cs.IT↗
arXiv2020

On the intersection distribution of degree three polynomials and related topics

The intersection distribution of a polynomial $f$ over finite field $\mathbb{F}_q$ was recently proposed in Li and Pott (arXiv:2003.06678v1), which concerns the collective behaviour of a collection of polynomials $\{f(x)+cx \mid c \in \mathbb{F}_q\}$. The intersection distribution has an underlying geometric interpretation, which indicates the intersection pattern between the graph of $f$ and the lines in the affine plane $AG(2,q)$. When $q$ is even, the long-standing open problem of classifying o-polynomials can be rephrased in a simple way, namely, classifying all polynomials which have the same intersection distribution as $x^2$. Inspired by this connection, we proceed to consider the next simplest case and derive the intersection distribution for all degree three polynomials over $\mathbb{F}_q$ with $q$ both odd and even. Moreover, we initiate to classify all monomials having the same intersection distribution as $x^3$, where some characterizations of such monomials are obtained and a conjecture is proposed. In addition, two applications of the intersection distributions of degree three polynomials are presented. The first one is the construction of nonisomorphic Steiner triple systems and the second one produces infinite families of Kakeya sets in affine planes with previously unknown sizes.

math.CO↗
arXiv2019

A Direct Construction of Primitive Formally Dual Pairs Having Subsets with Unequal Sizes

The concept of formal duality was proposed by Cohn, Kumar and Schürmann, which reflects a remarkable symmetry among energy-minimizing periodic configurations. This formal duality was later translated into a purely combinatorial property by Cohn, Kumar, Reiher and Schürmann, where the corresponding combinatorial objects were called formally dual pairs. So far, except the results presented in Li and Pott (arXiv:1810.05433v3), we have little information about primitive formally dual pairs having subsets with unequal sizes. In this paper, we propose a direct construction of primitive formally dual pairs having subsets with unequal sizes in $\mathbb{Z}_2 \times \mathbb{Z}_4^{2m}$, where $m \ge 1$. This construction recovers an infinite family obtained in Li and Pott (arXiv:1810.05433v3), which was derived by employing a recursive approach. Although the resulting infinite family was known before, the idea of the direct construction is new and provides more insights which were not known from the recursive approach.

math.CO↗
arXiv2019

On the weight distribution of second order Reed-Muller codes and their relatives

The weight distribution of second order $q$-ary Reed-Muller codes have been determined by Sloane and Berlekamp (IEEE Trans. Inform. Theory, vol. IT-16, 1970) for $q=2$ and by McEliece (JPL Space Programs Summary, vol. 3, 1969) for general prime power $q$. Unfortunately, there were some mistakes in the computation of the latter one. This paper aims to provide a precise account for the weight distribution of second order $q$-ary Reed-Muller codes. In addition, the weight distributions of second order $q$-ary homogeneous Reed-Muller codes and second order $q$-ary projective Reed-Muller codes are also determined.

cs.IT↗
arXiv2019

Constructions of Primitive Formally Dual Pairs Having Subsets with Unequal Sizes

The concept of formal duality was proposed by Cohn, Kumar and Schürmann, which reflects a remarkable symmetry among energy-minimizing periodic configurations. This formal duality was later on translated into a purely combinatorial property by Cohn, Kumar, Reiher and Schürmann, where the corresponding combinatorial objects were called formally dual pairs. Almost all known examples of primitive formally dual pairs satisfy that the two subsets have the same size. Indeed, prior to this work, there was only one known example having subsets with unequal sizes in $\mathbb{Z}_2 \times \mathbb{Z}_4^2$. Motivated by this example, we propose a lifting construction framework and a recursive construction framework, which generate new primitive formally dual pairs from known ones. As an application, for $m \ge 2$, we obtain $m+1$ pairwise inequivalent primitive formally dual pairs in $\mathbb{Z}_2 \times \mathbb{Z}_4^{2m}$, which have subsets with unequal sizes.

math.CO↗
arXiv2018

Formal Duality in Finite Abelian Groups

Inspired by an experimental study of energy-minimizing periodic configurations in Euclidean space, Cohn, Kumar and Schürmann proposed the concept of formal duality between a pair of periodic configurations, which indicates an unexpected symmetry possessed by the energy-minimizing periodic configurations. Later on, Cohn, Kumar, Reiher and Schürmann translated the formal duality between a pair of periodic configurations into the formal duality of a pair of subsets in a finite abelian group. This insight suggests to study the combinatorial counterpart of formal duality, which is a configuration named formally dual pair. In this paper, we initiate a systematic investigation on formally dual pairs in finite abelian groups, which involves basic concepts, constructions, characterizations and nonexistence results. In contrast to the belief that primitive formally dual pairs are very rare in cyclic groups, we construct three families of primitive formally dual pairs in noncyclic groups. These constructions enlighten us to propose the concept of even sets, which reveals more structural information about formally dual pairs and leads to a characterization of rank three primitive formally dual pairs. Finally, we derive some nonexistence results about primitive formally dual pairs, which are in favor of the main conjecture that except two small examples, no primitive formally dual pair exists in cyclic groups.

math.CO↗