Related papers: Complete flagged homogeneous polynomials
We consider actions, similar to those of Haglund, Rhoades, and Shimozono on ordered partitions, and their basis in terms of the higher Specht polynomials of Ariki, Terasoma, and Yamada, as carried out by Gillespie and Rhoades. By allowing…
Given a positive noncommutative polynomial $f$, equivalently a sum of Hermitian squares (SOHS), there exists a positive semidefinite Gram matrix that encrypts all the structural essence of $f$. There are no available methods for extending a…
In this note we consider the links of prime ideals of certain skew polynomial rings and prove our main theorem, namely theorem [5], which states the following.Let R be a noetherian ring that is link k-symmetric and let {\sigma} be an…
We recall first some basic facts on weighted homogeneous functions and filtrations in the ring $A$ of formal power series. We introduce next their analogues for weighted homogeneous diffeomorphisms and vector fields. We show that the Milnor…
The plethystic transformation $f[X] \mapsto f[X/(1-t)]$ and LLT polynomials are central to the theory of symmetric Macdonald polynomials. In this work, we introduce and study nonsymmetric flagged LLT polynomials. We show that these admit…
We construct the analogue of the plactic monoid for the super semistandard Young tableaux over a signed alphabet. This is done by developing a generalization of the Knuth's relations. Moreover we get generalizations of Greene's invariants…
We show that by working over the absolute base $\mathbb S$ (the categorical version of the sphere spectrum) instead of $\mathbb S[\pm 1]$ improves our previous Riemann-Roch formula for $\overline{{\rm Spec\,}\mathbb Z}$. The formula equates…
Let $K$ be a field and let $\mathbb N = \{1,2, \dots \}$. Let $R_n=K[x_{ij} \mid 1\le i\le n, j\in \mathbb N]$ be the ring of polynomials in $x_{ij}$ $(1 \le i \le n, j \in \mathbb N)$ over $K$. Let $S_n = Sym (\{1,2, \ldots, n \})$ and…
We use discrete holomorphic polynomials to prove that, given a refining sequence of critical maps of a Riemann surface, any holomorphic function can be approximated by a converging sequence of discrete holomorphic functions.
We introduce a new method of constructing complete sequences of key polynomials for simple extensions of tame fields. In our approach the key polynomials are taken to be the minimal polynomials over the base field of suitably constructed…
In this paper, we define a homogeneous polynomial for a general hypergraph, and establish a remarkable connection between clique number and the homogeneous polynomial of a general hypergraph. For a general hypergraph, we explore some…
In a rather straightforward manner, we develop the well-known formula for the Stirling numbers of the first kind in terms of the (exponential) complete Bell polynomials where the arguments include the generalised harmonic numbers. We also…
We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.
We obtain results describing the behavior of the action of rotation generators on polynomials over a commutative ring. We also explore harmonic polynomials in a purely algebraic setting.
We present fully polynomial approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into partition functions of abstract combinatorial structures…
A graph is Schur-positive if its chromatic symmetric function expands nonnegatively in the Schur basis. All claw-free graphs are conjectured to be Schur-positive. We introduce a combinatorial object corresponding to a graph G, called a…
In this paper we focus on two new families of polynomials which are connected with exponential polynomials and geometric polynomials. We discuss their generalizations and show that these new families of polynomials and their generalizations…
We introduce a triangular array $\widehat{\sf L}^{(\alpha)}$ of 5-variable homogeneous polynomials that enumerate Laguerre digraphs (digraphs in which each vertex has out-degree 0 or 1 and in-degree 0 or 1) with separate weights for peaks,…
We provide a specific representation of convex polynomials nonnegative on a convex (not necessarily compact) basic closed semi-algebraic subset K of Rn. Namely, they belong to a specific subset of the quadratic module generated by the…
Rook polynomials are a powerful tool in the theory of restricted permutations. It is known that the rook polynomial of any board can be computed recursively, using a cell decomposition technique of Riordan. In this paper, we give a new…