Related papers: Lamps, Factorizations and Finite Fields
The question about maximal size of independent system of word equations is one of the most striking problems in combinatorics on words. Recently, Aleksi Saarela has introduced a new approach to the problem that is based on linear-algebraic…
We investigate bicomplex analogues of fundamental notions from classical algebraic number theory. In particular, we show that the primitive element theorem admits a natural generalization to bicomplex extensions, giving rise to two distinct…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
We formulate a conjecture concerning spectral factorization of a class of trigonometric polynomials of two variables and prove it for special cases. Our method uses relations between the distribution of values of a polynomial of two…
Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper…
It is shown that the reflection 2Cat --> 2Preord of the category of all 2-categories into the category of 2-preorders determines a monotone-light factorization system on 2Cat and that the light morphisms are precisely the 2-functors…
We investigate the factorization problem as well as the classifying complements problem in the setting of Jordan algebras. Matched pairs of Jordan algebras and the corresponding bicrossed products are introduced. It is shown that any Jordan…
An additive fast Fourier transform over a finite field of characteristic two efficiently evaluates polynomials at every element of an $\mathbb{F}_2$-linear subspace of the field. We view these transforms as performing a change of basis from…
In this paper, we present a linear algebraic approach to the study of permutation polynomials that arise from linear maps over a finite field $\mathbb{F}_{q^2}$. We study a particular class of permutation polynomials over…
In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…
We obtain similar types of conclusions as that of Br\"{u}ck [1] for two differential polynomials which in turn radically improve and generalize several existing results. Moreover, a number of examples have been exhibited to justify the…
We discuss a conjecture concerning the enumeration of nonsingular matrices over a finite field that are block companion and whose order is the maximum possible in the corresponding general linear group. A special case is proved using some…
We develop a harmonic analysis on objects of some category $C_2$ of infinite-dimensional filtered vector spaces over a finite field. It includes two-dimensional local fields and adelic spaces of algebraic surfaces defined over a finite…
Answering a question of Frank Calegari, we extend some of our earlier results on dimension of fixed point spaces of elements in irreducible linear groups. We consider characteristic polynomials rather than just fixed spaces.
Using the modified factorization method employed by Mielnik for the harmonic oscillator, we show that isospectral structures associated with a second order operator $H$, can always be constructed whenever $H$ could be factored, or exist…
The study of iterations of functions over a finite field and the corresponding functional graphs is a growing area of research with connections to cryptography. The behaviour of such iterations is frequently approximated by what is know as…
In this paper, a transform approach is used for polycyclic and serial codes over finite local rings in the case that the defining polynomials have no multiple roots. This allows us to study them in terms of linear algebra and invariant…
A nice factorization is given for the characteristic polynomials of intervals in some posets of leaf-labeled forests of rooted binary trees.
Given a finite Markov chain, we investigate the first minors of the transition matrix of a lifting of this Markov chain to covering trees. In a simple case we exhibit a nice factorisation of these minors, and we conjecture that it holds…
Permutation polynomials with explicit constructions over finite fields have long been a topic of great interest in number theory. In recent years, by applying linear translators of functions from $\mathbb{F}_{q^n}$ to $\mathbb{F}_q$, many…