Related papers: Polynomial Maps of Modules
We introduce a notion of duality for a Lie-Rinehart algebra giving certain bilinear pairings in its cohomology generalizing the usual notions of Poincar\'e duality in Lie algebra cohomology and de Rham cohomology. We show that the duality…
We classify the polynomials with integral coefficients that, when evaluated on a group element of finite order $n$, define a unit in the integral group ring for infinitely many positive integers $n$. We show that this happens if and only if…
Let G be a finite group acting linearly on the polynomial ring with invariant ring R. If the action is small, then a classical result of Auslander gives in dimension two a correspondence between linear representations of G and maximal…
Expansive polynomials (whose roots are greater than 1 in modulus) often arise in dynamical systems and other computational problems. This paper examines the expansivity gap (the gap between 1 and the smallest modulus of the roots) of these…
We link the study of positive quantum maps, block positive operators, and entanglement witnesses with problems related to multivariate polynomials. For instance, we show how indecomposable block positive operators relate to biquadratic…
We prove a quantitative Roth-type theorem for polynomial corners in $\mathbb{R}^2$. Let $P_1$ and $P_2$ be two linearly independent polynomials with zero constant term. We show that any measurable subset of $[0,1]^2$ with positive measure…
If $A$ is a finite group (or a finite ring) and $\omega$ is a word map (or a polynomial map), we define the quantity $|\omega(A)|/|A|$ as the image ratio of $\omega$ on $A$ and will be denoted by $\mu(\omega,A)$. In this article, we…
The group isomorphism problem in computational complexity asks whether two finite groups given by their Cayley tables are isomorphic or not. Although polynomial-time isomorphism tests exist for many specific types of groups, no general…
In this note we give a theoretical support by means of quotient polynomial rings for the computation formulas of the dimension of abelian codes.
We extend the polynomial approach to hook length formula proposed in a recent joint paper with K\'arolyi, Nagy and Volkov to several other problems of the same type, including number of paths formula in the Young graph of strict partitions.
We prove a sufficient condition for the Jacobian problem in the setting of real, complex and mixed polynomial mappings. This follows from the study of the bifurcation locus of a mapping subject to a new Newton non-degeneracy condition.
We give a bijective correspondence between the number of nilpotent matrices over a Boolean semiring and the number of directed acyclic graphs on ordered vertices. We then enumerate pairs of maps between two finite sets whose composites are…
A motivation to study Gr\"{o}bner theory for fields with valuations comes from tropical geometry, for example, they can be used to compute tropicalization of varieties \citep{maclagan2009introduction}. The computational aspect of this…
Numerical characteristics of polynomial identities of left nilpotent algebras are examined. Previously, we came up with a construction which, given an infinite binary word, allowed us to build a two-step left nilpotent algebra with…
We consider the family $\mathrm{MP}_d$ of affine conjugacy classes of polynomial maps of one complex variable with degree $d \geq 2$, and study the map $\Phi_d:\mathrm{MP}_d\to \widetilde{\Lambda}_d \subset \mathbb{C}^d / \mathfrak{S}_d$…
A well known method to solve the Polynomial Eigenvalue Problem (PEP) is via linearization. That is, transforming the PEP into a generalized linear eigenvalue problem with the same spectral information and solving such linear problem with…
By introducing motivic Milnor fibers at infinity of polynomial maps, we propose some methods for the study of nilpotent parts of monodromies at infinity. The numbers of Jordan blocks in the monodromy at infinity will be described by the…
The notion of essential submodules and essential extensions of modules are extended to groups (typically nonabelian), and several necessary and sufficient conditions for a group to possess a proper essential subgroup are investigated.…
Polynomial Systems, or at least their algorithms, have the reputation of being doubly-exponential in the number of variables [Mayr and Mayer, 1982], [Davenport and Heintz, 1988]. Nevertheless, the Bezout bound tells us that that number of…
We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…