Related papers: The Graph Structure of Chebyshev Permutation Polyn…
We derive two formulas for the weighted sums of rooted spanning forests of particular sequence of graphs by using the matrix tree theorem. We consider cycle graphs with edges so called the pendant edges. One of our formula can be described…
This paper explores the concept of multiset dimensions (Mdim) of compressed zero-divisor graphs (CZDG) associated with rings. The authors investigate the interplay between the ring-theoretic properties of a ring $R$ and the associated…
Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…
We study permutation polynomials through the device of the \emph{polypermutation group} of an associative ring $R$, denoted by ${\rm Pgr}(R)$. We derive some basic properties and compute the cardinality of ${\rm Pgr}(\mathbb{Z}/p^k)$ when…
Generating random and pseudorandom numbers with a deterministic system is a long-standing challenge in theoretical research and engineering applications. Several pseudorandom number generators based on the inversive congruential method have…
We study pseudo-geometric strongly regular graphs whose second subconstituent with respect to a vertex is a cover of a strongly regular graph or a complete graph. By studying the structure of such graphs, we characterize all graphs…
In this paper convolutional codes with cyclic structure will be investigated. These codes can be understood as left principal ideals in a suitable skew-polynomial ring. It has been shown in [3] that only certain combinations of the…
A permutation is said to be \emph{alternating} if it starts with rise and then descents and rises come in turn. In this paper we study the generating function for the number of alternating permutations on $n$ letters that avoid or contain…
In a previous paper by the author a universal ring of invariants for algebraic structures of a given type was constructed. This ring is a polynomial algebra that is generated by certain trace diagrams. It was shown that this ring admits the…
In [5, 6] it has been proved that the ring of quasisymmetric functions over the integers is free polynomial, see also [4]. This is a matter that has been of great interest since 1972; for instance because of the role this statement plays in…
We study functional graphs generated by several quadratic polynomials, acting simultaneously on a finite field of odd characteristic. We obtain several results about the number of leaves in such graphs. In particular, in the case of graphs…
We prove model completeness for the theory of addition and the Frobenius map for certain subrings of rational functions in positive characteristic. More precisely: Let $p$ be a prime number, $\mathbb{F}_{p}$ the prime field with $p$…
A Hamiltonian path (cycle) in a graph is a path (cycle, respectively) which passes through all of its vertices. The problems of deciding the existence of a Hamiltonian cycle (path) in an input graph are well known to be NP-complete, and…
After fixing a triangulation $L$ of a $k$-dimensional simplex that has no new vertices on the boundary, we introduce a triangulation operation on all simplicial complexes that replaces every $k$-face with a copy of $L$, via a sequence of…
Recently, $(\beta,\gamma)$-Chebyshev functions, as well as the corresponding zeros, have been introduced as a generalization of classical Chebyshev polynomials of the first kind and related roots. They consist of a family of orthogonal…
For a finite group acting on a polynomial ring, the Chevalley-Shephard-Todd Theorem proves that the fixed subring is isomorphic to a polynomial ring if and only if the group is generated by pseudo-reflections. In recent years, progress was…
Planar bicolored (plabic) graphs are combinatorial objects introduced by Postnikov to give parameterizations of the positroid cells of the totally nonnegative Grassmannian $\text{Gr}^{\geq 0}(n,k)$. Any two plabic graphs for the same…
The chromatic polynomial $\pi_{G}(k)$ of a graph $G$ can be viewed as counting the number of vertices in a family of coloring graphs $\mathcal C_k(G)$ associated with (proper) $k$-colorings of $G$ as a function of the number of colors $k$.…
In this paper, we introduce and study two new classes of commutative rings, namely semi transitional rings and transitional rings, which extend several classical ideas arising from rings of continuous functions and their variants. A general…
We introduce a new graph polynomial that encodes interesting properties of graphs, for example, the number of matchings and the number of perfect matchings. Most importantly, for bipartite graphs the polynomial encodes the number of…