Related papers: The Graph Structure of Chebyshev Permutation Polyn…
Gcd-graphs over the ring of integers modulo $n$ are a natural generalization of unitary Cayley graphs. The study of these graphs has foundations in various mathematical fields, including number theory, ring theory, and representation…
Let $\mathcal{O}_{K}$ be the ring of integers of an imaginary quadratic field $K$. Recently, Ji and Xie proved that every rational map $f \colon \widehat{\mathbb{C}} \rightarrow \widehat{\mathbb{C}}$ of degree $d \geq 2$ whose multipliers…
Let $\mathbb{F}_{q}$ be the finite field with $q$ elements. In this paper we will describe the dynamics of the map $f(X)=X(X^{q-1}-c)^{q+1},$ with $c\in\mathbb{F}_{q}^{\ast},$ over the finite field $\mathbb{F}_{q^2}$.
It is proved that for integers $b, r$ such that $3 \leq b < r \leq \binom{b+1}{2} - 1$, there exists a red/blue edge-colored graph such that the red degree of every vertex is $r$, the blue degree of every vertex is $b$, yet in the closed…
We give a representation of the classical theory of multiplicative arithmetic functions (MF)in the ring of symmetric polynomials. The basis of the ring of symmetric polynomials that we use is the isobaric basis, a basis especially sensitive…
This paper describes how many known graph polynomials arise from the coefficients of chromatic symmetric function expansions in different bases, and studies a new polynomial arising by expanding over a basis given by chromatic symmetric…
In this paper we completely describe the unital compressed commuting graph of the ring $\mathcal{M}_3(\mathrm{GF}(p))$ of $3 \times 3$ matrices over the finite prime field $\mathrm{GF}(p)$. To achieve this we combine methods from linear…
In this article, we study the structure of the graph implied by a given map on the set $S_p=\{1,2,\dots,p-1\}$, where $p$ is an odd prime. The consecutive applications of the map generate an integer sequence, or in graph theoretical context…
We study the chromatic symmetric function on graphs, and show that its kernel is spanned by the modular relations. We generalize this result to the chromatic quasisymmetric function on hypergraphic polytopes, a family of generalized…
The domination polynomial (the total domination polynomial) of a graph $ G $ of order $ n $ is the generating function of the number of dominating sets (total dominating sets) of $ G $ of any size. In this paper, we study the domination…
We demonstrate that if $p\in\mathbb{R}[x]$ and $p$ is not an even function, then $\{p(k)\}^{\infty}_{k=0}$ is not a multiplier sequence for the basis of Chebyshev polynomials of the first kind. We also give a characterization of geometric…
Let $r\geq 3$ be any positive integer which is relatively prime to $p$ and $q^2\equiv 1 \pmod r$. Let $\tau_1, \tau_2$ be any permutation polynomials over $\mathbb{F}_{q^2},$ $\sigma_M$ is an invertible linear map over $\mathbb{F}_{q^2}$…
Given a graph $G$ whose edges are labeled by ideals of a commutative ring $R$ with identity, a generalized spline is a vertex labeling of $G$ by the elements of $R$ so that the difference of labels on adjacent vertices is an element of the…
In this paper we study spectral triples and non-commutative expectations associated to expanding and weakly expanding maps. In order to do so, we generalize the Perron-Frobenius-Ruelle theorem and obtain a polynomial decay of the operator,…
We investigate, using the notion of linear quotients, significative classes of connected graphs whose monomial edge ideals, not necessarily squarefree, have linear resolution, in order to compute standard algebraic invariants of the…
We study the images of polynomial maps over algebraically closed division rings. Our first result generalizes the classical Ax-Grothendieck theorem: We show that if $ f_1, \ldots, f_m $ are elements of the free associative algebra $…
We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. We give formulas for their dimension and vertex degree. In the…
Let $G^\sigma$ be an orientation of a simple graph $G$. In this paper, the permanental polynomial of an oriented graph $G^\sigma$ is introduced. The coefficients of the permanental polynomial of $G^\sigma$ are interpreted in terms of the…
In this paper we describe polynomials orthogonal to all powers of a Chebyshev polynomial on a segment.
Each group G of nxn permutation matrices has a corresponding permutation polytope, P(G):=conv(G) in R^{nxn}. We relate the structure of P(G) to the transitivity of G. In particular, we show that if G has t nontrivial orbits, then…