Related papers: Poincar\'e Polynomials of Odd Diagram Classes
A graph is an opposition graph, respectively, a coalition graph, if it admits an acyclic orientation which puts the two end-edges of every chordless 4-vertex path in opposition, respectively, in the same direction. Opposition and coalition…
We study alternating strand diagrams on the disk with an orbifold point. These are quotients by rotation of Postnikov diagrams on the disk, and we call them orbifold diagrams. We associate a quiver with potential to each orbifold diagram,…
A boundary singularity is a singularity of a function on a manifold with boundary. The simple and unimodal boundary singularities were classified by V. I. Arnold and V. I. Matov. The McKay correspondence can be generalized to the simple…
An {\em ordered $r$-graph} is an $r$-uniform hypergraph whose vertex set is linearly ordered. Given $2\leq k\leq r$, an ordered $r$-graph $H$ is {\em interval} $k$-{\em partite} if there exist at least $k$ disjoint intervals in the ordering…
In this paper we consider in detail the composition of an irreducible polynomial with X^2 and suggest a recurrent construction of irreducible polynomials of fixed degree over finite fields of odd characteristics. More precisely, given an…
We consider divisorial filtration on the rings of functions on hypersurface singularities associated with Newton diagrams and their analogues for plane curve singularities. We compute the multi-variable Poincar\'e series for the latter…
Let $\mathcal{I}_{d_1,d_2}$ and $\mathcal{C}_{d_1,d_2}$ be the algebras of joint invariants and joint covariants of the two binary forms of degrees $d_1$ and $d_2.$ Formulas for computation of the Poincar\'e series…
Recently O. Bernardi gave a formula for the Tutte polynomial $T(x,y)$ of a graph, based on spanning trees and activities just like the original definition, but using a fixed ribbon structure to order the set of edges in a different way for…
We revisit the classical problem of optimal experimental design (OED) under a new mathematical model grounded in a geometric motivation. Specifically, we introduce models based on elementary symmetric polynomials; these polynomials capture…
Coloring the arcs of biregular graphs was introduced with possible applications to industrial chemistry, molecular biology, cellular neuroscience, etc. Here, we deal with arc coloring in some non-bipartite graphs. In fact, for…
We introduce a space of stable meromorphic differentials with poles of prescribed orders and define its tautological cohomology ring. This space, just as the space of holomorphic differentials, is stratified according to the set of…
Let $T(n,m)$ be the set of all plane labelled bipartite trees with $n$ white vertices and $m$ black. If the number $n+m$ of vertices is even, then the set $T(n,m)$ is a union of two disjoint subsets --- subset od "even" trees and subset of…
Categories of partitions are combinatorial structures arising from the representation theory of certain compact quantum groups and are linked to classical diagram algebras such as the Temperley-Lieb algebra. In this paper, we present…
Let $p$ be an odd prime, $k,\ell$ be positive integers, $q=p^k, Q=p^{\ell}$. In this paper we characterise planar functions of the form $f_{\underline{c}}(X)=c_0X^{qQ+q}+c_1X^{qQ+1}+c_2X^{Q+q}+c_3X^{Q+1}$ over $\mathbb{F}_{q^2}$ for any…
The $(-1)$-Jacobi, Bannai-Ito, and $(-1)$-Meixner-Pollaczek polynomials are studied in [Trans. Amer. Math. Soc. 364 (2012), 5491-5507], [Adv. Math. 229 (2012), 2123-2158], and [Stud. Appl. Math. 153 (2024), e12728], respectively, through…
Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of…
The partition of graphs into "nice" subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into same-size stars, a problem known to be NP-complete even for the case of…
Let H be a connected bipartite graph with n nodes and m edges. We give an O(nm) time algorithm to decide whether H is an interval bigraph. The best known algorithm has time complexity O(nm^6(m + n) \log n) and it was developed in 1997 [18].…
We consider simple superalgebras which are a supersymmetric extension of $\fspin(s,t)$ in the cases where the number of odd generators does not exceed 64. All of them contain a super Poincar\'e algebra as a contraction and another as a…
We define several homology theories for central hyperplane arrangements, categorifying well-known polynomial invariants including the characteristic polynomial, Poincare polynomial, and Tutte polynomial. We consider basic algebraic…