Related papers: Christoffel-Darboux type identities for independen…

For $p \in \mathbb{Q}_+ \smallsetminus \{ 1 \}$ a positive rational number different from one, we say that the Puisseux series $f \in \mathbb{C}((t))^\text{alg}$ is $p$-Mahler of non-exceptional polynomial type if there is a polynomial $P…

This paper investigates the independence polynomials arising from iterated strong products of cycle graphs, examining their algebraic symmetries and combinatorial structures. Leveraging modular arithmetic and Galois theory, we establish…

The Christoffel-Darboux kernels for orthogonal polynomials in several real variables are investigated within the context of the three term recurrence relation reformulated for this purpose. Examples of orthogonal polynomials on the unit…

Motivated by the Dani-Mainkar construction, we extend the notion of independence polynomial of graphs to arbitrary 2-step nilpotent Lie algebras. After establishing efficiently computable upper and lower bounds for the independence number,…

We prove here the Wolff-Denjoy-type theorem for a very large class of pseudoconvex domains in $\mathbb C^n$ that may contain many classes of pseudoconvex domains of finite type and infinite type.

Let $X$ be a second countable locally compact Abelian group. We prove some group analogues of the Skitovich--Darmois, Heyde and Kac--Bernstein characterisation theorems for $Q$-independent random variables taking values in the group $X$.…

We introduce a new one-variable polynomial invariant of graphs, which we call the skew characteristic polynomial. For an oriented simple graph, this is just the characteristic polynomial of its anti-symmetric adjacency matrix. For…

We disprove the characterisation of graphs with equal independence and annihilation number by Larson and Pepper (2011). Series of counterexamples with arbitrary number of vertices, arbitrary number of components, arbitrary large…

The independence polynomial $i(G,x)$ of a graph $G$ is the generating function of the numbers of independent sets of each size. A graph of order $n$ is very well-covered if every maximal independent set has size $n/2$. Levit and Mandrescu…

Let G = (V;E) be a simple graph. We consider domination polynomial, matching polynomial and edge cover polynomial of G. Graphs which their polynomials have few roots can give sometimes a very surprising information about the structure of…

Let $G$ be a simple graph and $I(G)$ be its edge ideal. In this article, we study the Castelnuovo-Mumford regularity of symbolic powers of edge ideals of join of graphs. As a consequence, we prove Minh's conjecture for wheel graphs,…

Given two graphs $G$ and $H$, assume that $\mathscr{C}=\{C_1,C_2,\ldots, C_q\}$ is a clique cover of $G$ and $U$ is a subset of $V(H)$. We introduce a new graph operation called the clique cover product, denoted by $G^{\mathscr{C}}\star…

In 1982 Macdonald published his now famous constant term conjectures for classical root systems. This paper begins with the almost trivial observation that Macdonald's constant term identities admit an extra set of free parameters, thereby…

We reduce the conditionally monotone (c-monotone) independence of Hasebe to tensor independence. For that purpose, we use the approach developed for the reduction of boolean, free and monotone independences to tensor independence. We apply…

In this paper we study the Castelnuovo-Mumford regularity of the path ideals of finite simple graphs. We find new upper bounds for various path ideals of gap free graphs. In particular we prove that the path ideals of gap free and claw…

We prove a Darboux-Jouanolou type theorem on the algebraic integrability of polynomial differential $r$-forms over arbitrary fields ($r\geq 1$). We also investigate the Darboux's method for producing integrating factors.

It is shown that if the binomial edge ideal of a graph $G$ defines a Koszul algebra, then $G$ must be chordal and claw free. A converse of this statement is proved for a class of chordal and claw free graphs.

In this paper we obtain several new identities for Bernoulli and Euler polynomials; some of them extend Miki's and Matiyasevich's identities. Our new method involves differences and derivatives of polynomials.

For some positive integer $m$, a real polynomial $P(x)=\sum\limits_{k=0}^ma_kx^k$ with $a_k\geqslant 0$ is called log-concave (resp. ultra log-concave) if $a_k^2\geqslant a_{k-1}a_{k+1}$ (resp. $a_k^2\geqslant…

In [1] Peters and Regts confirmed a conjecture by Sokal by showing that for every $\Delta \in \mathbb{Z}_{\geq 3}$ there exists a complex neighborhood of the interval $\left[0, \frac{\left(\Delta - 1\right)^{\Delta -…