Related papers: On few-class $Q$-polynomial association schemes: f…
We prove that, if $x$ and $q\leqslant x^{1/16}$ are two parameters, then for any invertible residue class $a$ modulo $q$ there exists a product of exactly three primes, each one below $x^{1/3}$, that is congruent to $a$ modulo $q$.
Counting the number of independent sets for a bipartite graph (#BIS) plays a crucial role in the study of approximate counting. It has been conjectured that there is no fully polynomial-time (randomized) approximation scheme (FPTAS/FPRAS)…
This paper begins with a class of convex quadratic programs (QPs) with bounded variables solvable by the parametric principal pivoting algorithm with $\mathcal{O}(n^3)$ strongly polynomial complexity, where $n$ is the number of variables of…
Leading towards the classification of primitive commutative association schemes as the ultimate goal, Bannai and some of his school have been trying to * identify the major sources of (primitive) commutative association schemes, * collect…
B. Xu characterized rank $4$ self-dual association schemes inducing three partial geometric designs by their character tables. We construct such association schemes as Schur rings over abelian $2$-groups.
Following Verde-Star, Linear Algebra Appl. 627 (2021), we label families of orthogonal polynomials in the $q=1$ Askey scheme together with their hypergeometric representations by three sequences $x_k, h_k, g_k$ of polynomials in $k$, two of…
We construct some families of quadratic fields whose class numbers are divisible by $3.$ The main tools used are a trinomial introduced by Kishi and a parametrization of Kishi and Miyake of a family of quadratic fields whose class numbers…
Ovoids of the non-degenerate quadric Q(4,q) of PG(4,q) have been studied since the end of the '80s. They are rare objects and, beside the classical example given by an elliptic quadric, only three classes are known for q odd, one class for…
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…
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching polynomial of complete bipartite graphs with bounded weights…
We introduce a class of algorithms, termed proximal interacting particle Langevin algorithms (PIPLA), for inference and learning in latent variable models whose joint probability density is non-differentiable. Leveraging proximal Markov…
In this paper, we study the structure of the complete asymptotic expansion of the probability that a large combinatorial object is connected or consists of a given number of connected components. For rapidly growing labeled families of…
We present an algebraic framework for the computation of low-degree cohomology of a class of bigraded complexes which arise in Poisson geometry around (pre)symplectic leaves. We also show that this framework can be applied to the more…
In this paper we first determine all irreducible representations of a wedge product of two table algebras in terms of the irreducible representations of two factors involved. Then we give some necessary and sufficient conditions for a table…
Coherent configurations are a generalization of association schemes. In this paper, we introduce the concept of $Q$-polynomial coherent configurations and study the relationship among intersection numbers, Krein numbers, and eigenmatrices.…
Given a field $F$ of characteristic 2, we prove that if every three quadratic $n$-fold Pfister forms have a common quadratic $(n-1)$-fold Pfister factor then $I_q^{n+1} F=0$. As a result, we obtain that if every three quaternion algebras…
We exhibit a 6-element semigroup that has no finite identity basis but nevertheless generates a variety whose finite membership problem admits a polynomial algorithm.
This paper investigates the existence and properties of spherical $5$-designs of minimal type. We focus on two cases: tight spherical $5$-designs and antipodal spherical $4$-distance $5$-designs. We prove that a tight spherical $5$-design…
In a 2022, Bartoli, Cossidente, Marino, and Pavese proved that in the projective space ${\rm PG}(3,q^3)$, one can find three $\mathbb F_q$-subgeometries such that the union of their point sets is a strong blocking set. This proves the…
As a generalization of orbit-polynomial and distance-regular graphs, we introduce the concept of a quotient-polynomial graph. In these graphs every vertex $u$ induces the same regular partition around $u$, where all vertices of each cell…