Related papers: Characteristics polynomial of normalized Laplacian…
A proper vertex of a rooted tree with totally ordered vertices is a vertex that is less than all its proper descendants. We count several kinds of labeled rooted trees and forests by the number of proper vertices. Our results are all…
In this paper, equivalence constants between various polynomial norms are calculated. As an application, we also obtain sharp values of the Hardy--Littlewood constants for $2$-homogeneous polynomials on $\ell_p^2$ spaces, $2<p\leq\infty$…
Let $B_n$ be a linear polyomino chain with $n$ squares. Let $B_n^2$ be the graph obtained by the strong prism of a linear polyomino chain with $n$ squares, i.e. the strong product of $K_2$ and $B_n$. In this paper, explicit expressions for…
The conformations of topologically constrained double-folded ring polymers can be described as wrappings of randomly branched primitive trees. We extend previous work on the tree statistics under different (solvent) conditions to explore…
We study spectral properties of the standard (also called Kirchhoff) Laplacian and the anti-standard (or anti-Kirchhoff) Laplacian on a finite, compact metric graph. We show that the positive eigenvalues of these two operators coincide…
A famous conjecture of Stanley states that his chromatic symmetric function distinguishes trees. As a quasisymmetric analogue, we conjecture that the chromatic quasisymmetric function of Shareshian and Wachs and of Ellzey distinguishes…
We define the generalized hypergeometric polynomial of degree N in terms of the generalized hypergeometric function that depends on p parameters a_1, ..., a_p and q parameters b_1, ..., b_q. The parameters are "generic", possibly complex,…
The trigonometric monomial $\cos(\left\langle k, x \right\rangle)$ on $\mathbb{T}^d$, a harmonic polynomial $p: \mathbb{S}^{d-1} \rightarrow \mathbb{R}$ of degree $k$ and a Laplacian eigenfunction $-\Delta f = k^2 f$ have root in each ball…
We investigate polynomials, called m-polynomials, whose generator polynomial has coefficients that can be arranged as a matrix, where q is a positive integer greater than one. Orthogonality relations are established and coefficients are…
We consider the set $\mathcal{M}_n(\mathbb{Z}; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain upper and lower bounds on the number of distinct irreducible characteristic polynomials which correspond to…
Stanley introduced the concept of chromatic symmetric functions of graphs which extends and refines the notion of chromatic polynomials of graphs, and asked whether trees are determined up to isomorphism by their chromatic symmetric…
Some families of linear permutation polynomials of $\mathbb{F}_{q^{ms}}$ with coefficients in $\mathbb{F}_{q^{m}}$ are explicitly described (via conditions on their coefficients) as isomorphic images of classical subgroups of the general…
We define a family of symmetric and a family of non-symmetric polynomials in terms of vanishing conditions. These families depend on two paramters, q and t. Their main feature is that they consist of non-homogeneous polynomials. The…
The characteristic polynomials of the Laplacian and the distance Laplacian matrices of power graphs of groups of order $ pqr $, where $ p,q $ and $ r $ are { primes,} are obtained. Further, the characteristic polynomials of these matrices…
For fixed $t\ge 2$, we consider the class of representations of $1$ as sum of unit fractions whose denominators are powers of $t$ or equivalently the class of canonical compact $t$-ary Huffman codes or equivalently rooted $t$-ary plane…
We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…
We provide a combinatorial description of the coefficients appearing in the expansion of Hall-Littlewood polynomials in terms of monomial symmetric functions. We also give a Littlewood-Richardson rule for Hall-Littlewood polynomials. For…
We provide an asymptotic expression for the probability that a randomly chosen polynomial with given degree, having integral coefficients bounded by some B, has a prescribed signature. We also give certain related formulas and numerical…
We compute the characteristic polynomials of the posets of hypertrees. We show that the generating series of the polynomials can be expressed using cyclic hypertrees. We also propose a conjecture on the action of the symmetric groups on the…
In the objective of studying concentration and oscillation properties of eigenfunctions of the discrete Laplacian on regular graphs, we construct a pseudo-differential calculus on homogeneous trees, their universal covers. We define symbol…