Related papers: Graph Structure of Chebyshev Permutation Polynomia…
Trigonometric polynomials are usually defined on the lattice of integers.We consider the larger class of weight and root lattices with crystallographic symmetry.This article gives a new approach to minimize trigonometric polynomials, which…
There are various results connecting ranks of incidence matrices of graphs and hypergraphs with their combinatorial structure. Here, we consider the generalized incidence matrix $N_2$ (defined by inclusion of pairs in edges) for one natural…
The paper studies the question of existence of polynomials with given roots over associative non-commutative rings with identity. It is shown that in the case of an associative division ring for arbitrary n elements of this ring there…
Consider the conjugation action of the general linear group $\operatorname{GL}_{2}(K)$ on the polynomial ring $K[X_{2 \times 2}]$. When $K$ is an infinite field, the ring of invariants is a polynomial ring generated by the trace and the…
In this paper we compute the Reduced Fox Coloring Group of the diagrams of Wheel Graphs which can also be represented at the closure of the braids $(\sigma_1 \sigma_2^{-1})^n$. In doing so, we utilize Fibonacci numbers and their properties.…
Let $\pi=(\pi_1,\pi_2,\hdots,\pi_n)$ be permutation of the elements $1,2,\hdots,n. $ Positive integer $k\leq2^{n-1}$ we call index of $\pi,$ if in its binary notation as $n$-digital binary number, the 1's correspond to the ascent points. We…
In this paper, the dynamics of the Chebyshev-Halley family is studied on quadratic polynomials. A singular set, that we call cat set, appears in the parameter space associated to the family. This cat set has interesting similarities with…
For an arbitrary associative unital ring $R$, let $J_1$ and $J_2$ be the following noncommutative birational partly defined involutions on the set $M_3(R)$ of $3\times 3$ matrices over $R$: $J_1(M)=M^{-1}$ (the usual matrix inverse) and…
We give an especially simple proof of a theorem in graph theory that forms the key part of the solution to a problem in commutative algebra, on how to characterize the integral closure of a polynomial ring generated by quadratic monomials.
Kontsevich constructed a map between `good' graph cocycles $\gamma$ and infinitesimal deformations of Poisson bivectors on affine manifolds, that is, Poisson cocycles in the second Lichnerowicz--Poisson cohomology. For the tetrahedral graph…
We study the differential polynomial rings which are defined using the special geometry of the moduli spaces of Calabi-Yau threefolds. The higher genus topological string amplitudes are expressed as polynomials in the generators of these…
We study the homogeneous coordinate rings of real multiplication noncommutative tori as defined by A. Polishchuk. Our aim is to understand how these rings give rise to an arithmetic structure on the noncommutative torus. We start by giving…
Spin-tomographic symbols of qudit states and spin observables are studied. Spin observables are associated with the functions on a manifold whose points are labelled by spin projections and 2-sphere coordinates. The star-product kernel for…
In this paper we prove that every automorphism of a Chevalley group (or its elementary subgroup) with root system of rank >1 over a commutative ring (with 1/2 for the systems A_2, F_4, B_l, C_l; with 1/2 and 1/3 for the system G_2) is…
The concept of domination in graphs plays a central role in understanding structural properties and applications in network theory. In this study, we focus on the paired disjunctive domination number in the context of middle graphs, a…
We give a new characterization of the peak subalgebra of the algebra of quasisymmetric functions and use this to construct a new basis for this subalgebra. As an application of these results we obtain a combinatorial formula for the…
We study the eigenvalues of the unique connected anti-regular graph $A_n$. Using Chebyshev polynomials of the second kind, we obtain a trigonometric equation whose roots are the eigenvalues and perform elementary analysis to obtain an…
It is well known that matrices with low Hessenberg-structured displacement rank enjoy fast algorithms for certain matrix factorizations. We show how $n\times n$ principal finite sections of the Gram matrix for the orthogonal polynomial…
A graph $G = (V, E)$ is said to be word-representable if a word $w$ can be formed using the letters of the alphabet $V$ such that for every pair of vertices $x$ and $y$, $xy \in E$ if and only if $x$ and $y$ alternate in $w$. A…
In a directed graph, a kernel is a subset of vertices that is both stable and absorbing. Not all digraphs have a kernel, but a theorem due to Boros and Gurvich guarantees the existence of a kernel in every clique-acyclic orientation of a…