相关论文: A characterization of Q-polynomial association sch…

We present a more general proof that cyclotomic polynomials are irreducible over Q and other number fields that meet certain conditions. The proof provides a new perspective that ties together well-known results, as well as some new…

Let $\mathbb{F}$ be a field. We show that given any $n$th degree monic polynomial $q(x)\in \mathbb{F}[x]$ and any matrix $A\in\mathbb{M}_n(\mathbb{F})$ whose trace coincides with the trace of $q(x)$ and consisting in its main diagonal of…

We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a family of real polynomials defining regular hypersurfaces that…

In this paper, we introduce an equivariant version of the characteristic quasi-polynomials as the permutation characters on the complement of mod $q$ hyperplane arrangements. We prove that the permutation character is a quasi-polynomial in…

There is a type of distance-regular graph, said to be $Q$-polynomial. In this paper we investigate a generalized $Q$-polynomial property involving a graph that is not necessarily distance-regular. We give a detailed description of an…

We present an algebraic characterization of perfect graphs, i.e., graphs for which the clique number and the chromatic number coincide for every induced subgraph. We show that a graph is perfect if and only if certain nonnegative…

In this paper, we establish a $q$-integral formula by using the orthogonality relation, and also provide a new proof of the $q$-orthogonality relation for the continuous $q$-ultraspherical polynomials. A new $q$-beta integral with five…

We give two sufficient and necessary conditions for a Hochschild extension of a finite dimensional algebra by its dual bimodule and a Hochschild 2-cocycle to be a symmetric algebra.

A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.

A sufficient condition for the convergence of a generalized formal power series solution to an algebraic $q$-difference equation is provided. The main result leans on a geometric property related to the semi-group of (complex) power…

Let $\{\mathbb{P}_n\}_{n\ge 0}$ and $\{\mathbb{Q}_n\}_{n\ge 0}$ be two monic polynomial systems in several variables satisfying the linear structure relation $$\mathbb{Q}_n = \mathbb{P}_n + M_n \mathbb{P}_{n-1}, \quad n\ge 1,$$ where $M_n$…

Following Verde-Star, Linear Algebra Appl. 627 (2021), we label families of orthogonal polynomials in the $q$-Askey scheme together with their $q$-hypergeometric representations by three sequences $x_k, h_k, g_k$ of Laurent polynomials in…

Let ${\cal B}$ be a nontrivial biplane of order $k-2$ represented by symmetric canonical incidence matrix with trace $1+ \binom{k}{2}$. We proved that ${\cal B}$ includes a partially balanced incomplete design with association scheme of…

We use the symmetric product to describe the resultant scheme and discriminant scheme of polynomials two variables.

In this note we prove that the factorization theorem for dominated polynomials previously proved by the authors is equivalent to an alternative factorization scheme that uses classical linear techniques and a linearization process. However,…

We investigate intriguing sets of an association scheme introduced by Penttila and Williford (2011) that was the basis for their construction of primitive cometric association schemes that are not $P$-polynomial nor the dual of a…

Multiplicative relations between the roots of a polynomial in $\mathbb{Q}[x]$ have drawn much attention in the field of arithmetic and algebra, while the problem of computing these relations is interesting to researchers in many other…

In this paper, we derive eight basic identities of symmetry in three variables related to $q$-Bernoulli polynomials and the $q$-analogue of power sums. These and most of their corollaries are new, since there have been results only about…

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…

We introduce an algebra given by quadratic relations in an algebra of polynomials in an infinite number of variables. Using this algebra, we prove some explicit formulas for the Sturm sequence of a polynomial.