相关论文: Bannai-Ito polynomials and dressing chains

We introduce the notion of the descent set polynomial as an alternative way of encoding the sizes of descent classes of permutations. Descent set polynomials exhibit interesting factorization patterns. We explore the question of when…

We study skew-orthogonal polynomials with respect to the weight function $\exp[-2V(x)]$, with $V(x)=\sum_{K=1}^{2d}(u_{K}/{K})x^{K}$, $u_{2d} > 0$, $d > 0$. A finite subsequence of such skew-orthogonal polynomials arising in the study of…

Let $G$ be a Cameron--Walker graph on $n$ vertices and $J_G$ the binomial edge ideal of $G$. Let $S$ denote the polynomial ring in $2n$ variables over a field. It is shown that the following conditions are equivalent: (i) $S/J_G$ is…

In this paper, we introduce and study differential graded (DG for short) polynomial algebras. In brief, a DG polynomial algebra $\mathcal{A}$ is a connected cochain DG algebra such that its underlying graded algebra $\mathcal{A}^{\#}$ is a…

Let $G$ be a simple graph of order $n$. A dominating set of $G$ is a set $S$ of vertices of $G$ so that every vertex of $G$ is either in $S$ or adjacent to a vertex in $S$. The domination polynomial of $G$ is the polynomial…

The goal of the paper is two-fold. At first, we attempt to give a survey of some recent applications of symmetric polynomials and divided differences to intersection theory. We discuss: polynomials universally supported on degeneracy loci;…

This paper surveys a comprehensive, although not exhaustive, sampling of graph polynomials with the goal of providing a brief overview of a variety of techniques defining a graph polynomial and then for decoding the combinatorial…

The duality theorem of Lass relates the matching polynomials of a simple graph $G$ with the matching polynomials of its complement $\bar G$. In particular, this relation gives rise to Godsil's result, which offers a nice interpretation of…

Polynomial, or Delsarte's, method in coding theory accounts for a variety of structural results on, and bounds on the size of, extremal configurations (codes and designs) in various metric spaces. In recent works of the authors the…

Real-world networks exhibit prominent hierarchical and modular structures, with various subgraphs as building blocks. Most existing studies simply consider distinct subgraphs as motifs and use only their numbers to characterize the…

Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles…

We study the structure of the digit sets ${\mathcal D}$ for the integral self-similar tiles $T(b,{\mathcal{D}})$ (we call such ${\mathcal D}$ a {\it tile digit set} with respect to $b$). So far the only available classes of such tile digit…

Boij-S\"oderberg theory gives a combinatorial description of the set of Betti tables belonging to finite length modules over the polynomial ring $S = k[x_1, \ldots, x_n]$. We posit that a similar combinatorial description can be given for…

This is an expository survey on the theory of Bernstein-Sato polynomials with special emphasis in its recent developments and its importance in commutative algebra.

We introduce a new class of algebras arising from graphs, called binomial edge rings. Given a graph $G$ on $d$ vertices with $n$ edges, the binomial edge ring of $G$ is defined to be the subalgebra of the polynomial ring with $2d$ variables…

In this note we develop a systematic combinatorial definition for constructed earlier supersymmetric polynomial families. These polynomial families generalize canonical Schur, Jack and Macdonald families so that the new polynomials depend…

We construct a non-trivial type of 1-step exceptional Bannai-Ito polynomials which satisfy discrete orthogonality by using a generalized Darboux transformation. In this generalization, the Darboux transformed Bannai-Ito operator is directly…

We investigate decompositions of Betti diagrams over a polynomial ring within the framework of Boij-S\"oderberg theory. That is, given a Betti diagram, we determine if it is possible to decompose it into the Betti diagrams of complete…

We consider projections of points onto fundamental chambers of finite real reflection groups. Our main result shows that for groups of type $A_n$, $B_n$, and $D_n$, the coefficients of the characteristic polynomial of the reflection…

In this paper it is shown that it is possible to associate several polynomial ideals to a directed graph $D$ in order to find properties of it. In fact by using algebraic tools it is possible to give appropriate procedures for automatic…