Related papers: Cyclic matrices and polynomial interpolation over …
We study modular polynomials classifying cyclic isogenies between Drinfeld modules of arbitrary rank over the ring F_q[T].
We study connections between self-inversive and self-reciprocal polynomials, reduction theory of binary forms, minimal models of curves, and formally self-dual codes. We prove that if $\mathcal X$ is a superelliptic curve defined over…
Let k be a commutative algebra with the field of the rational numbers included in k and let (E,p,i) be a cleft extension of A. We obtain a new mixed complex, simpler than the canonical one, giving the Hochschild and cyclic homologies of E…
Motivated by the controllability/reachability problems for switched linear control systems and some classes of nonlinear (mechanical) control systems we address a related problem of existence of a cyclic vector for an associative (matrix)…
We associate canonically a cyclic module to any Hopf algebra endowed with a modular pair, consisting of a group-like element and a character, in involution. This provides the key construct allowing to extend cyclic cohomology to Hopf…
We introduce and study a special family of polynomials orthogonal on the unit circle (OPUC). These OPUC satisfy a mirror symmetry property of their Verblunsky coefficients. Several equivalent conditions for the OPUC to be mirror symmetric…
We consider chaining multiplicative-inverse operations in finite fields under alternating polynomial bases. When using two distinct polynomial bases to alternate the inverse operation we obtain a partition of $\mathbb F_{p^n}\setminus…
We study associative multiplications in semi-simple associative algebras over C compatible with the usual one. An interesting class of such multiplications is related to the affine Dynkin diagrams of A, D, E-type. In this paper we…
A polynomial $f(t)$ in an Ore extension $K[t;S,D]$ over a division ring $K$ is a Wedderburn polynomial if $f(t)$ is monic and is the minimal polynomial of an algebraic subset of $K$. These polynomials have been studied in "Wedderburn…
In this work, we study cyclic codes that have generators as Fibonacci polynomials over finite fields. We show that these cyclic codes in most cases produce families of maximum distance separable and optimal codes with interesting…
Circulant matrices are an important tool widely used in coding theory and cryptography. A circulant matrix is a square matrix whose rows are the cyclic shifts of the first row. Such a matrix can be efficiently stored in memory because it is…
In these proceedings we will review recent progress in applying ideas from the mathematical framework of twisted cohomology to the study of canonical differential equations for Feynman integrals. Firstly, we will show how the intersection…
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 a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…
A pattern of interpolation nodes on the disk is studied, for which the interpolation problem is theoretically unisolvent, and which renders a minimal numerical condition for the collocation matrix when the standard basis of Zernike…
Let $X$ be a smooth variety over a finite field $\mathbb{F}_q$. Let $\ell$ be a rational prime number invertible in $\mathbb{F}_q$. For an $\ell$-adic sheaf $\mathcal{F}$ on $X$, we construct a cycle supported on the singular support of…
We reconsider the theory of Lagrange interpolation polynomials with multiple interpolation points and apply it to linear algebra. For instance, $A$ be a linear operator satisfying a degree $n$ polynomial equation $P(A)=0$. One can see that…
We investigate actions of cyclic groups on polynomial rings with two variables, and the minimal free resolution of the corresponding invariant ring. In particular, we fully classify several cases, including the case the defining ideal has…
This paper present the construction cyclic isodual codes over finite fields and finite chain rings. These codes are monomially equivalent to their dual. Conditions are given for the existence of cyclic isodual codes. In addition, the…
The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…
Associating to each pre-order on the indices 1,...,n the corresponding structural matrix ring, or incidence algebra, embeds the lattice of n-element pre-orders into the lattice of n x n matrix rings. Rings within the order-convex hull of…