Related papers: Polynomial maps and polynomial sequences in groups

We give the characteristic polynomial of the distance or adjacency matrix of the strong power graph of a finite group, and compute its distance and adjacency spectrum.

We establish the homological foundations for studying polynomially bounded group cohomology, and show that the natural map from PH^*(G;Q) to H^*(G;Q) is an isomorphism for a certain class of groups.

In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…

We generalize the Uhlenbeck-Segal theory for harmonic maps into compact semi-simple Lie groups to general Lie groups equipped with torsion free bi-invariant connection.

The semigroup of the homotopy classes of the self-homotopy maps of a finite complex which induce the trivial homomorphism on homotopy groups is nilpotent. We determine the nilpotency of these semigroups of compact Lie groups and finite Hopf…

We define train track maps for graphs-of-groups $\cal G$ and exhibit the precise conditions under which the fundamental finiteness properties known for classical train track maps extend to this generalization. These finiteness properties…

We study properties of a map from a certain unitary group in $n$ variables to a related unitary group in $\binom{n}{k}$ variables. We explain how it gives rise to a map between canonical models of Shimura varieties and we prove that it…

We build free, bigraded bidifferential algebra models for the forms on a complex manifold, with respect to a strong notion of quasi-isomorphism and compatible with the conjugation symmetry. This answers a question of Sullivan. The resulting…

The study of word maps on groups has been of deep interest in recent years. This survey focuses on the case of power maps on groups; $viz.$ the map $x\mapsto x^M$ for a group $G$, and an integer $M\geq 2$. Here, we accumulate various…

In this note we generalise some of the work of Klarner on free semigroups of affine maps acting on the real line by using a classical approach from geometric group theory (the Ping-Pong lemma). We also investigate the boundaries within…

Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…

We introduce a notion of $R$-quadratic maps between modules over a commutative ring $R$ which generalizes several classical notions arising in linear algebra and group theory. On a given module $M$ such maps are represented by $R$-linear…

The most developed aspect of the theory of finite semigroups is their classification in pseudovarieties. The main motivation for investigating such entities comes from their connection with the classification of regular languages via…

With techniques borrowed from quantum information theory, we develop a method to systematically obtain operator inequalities and identities in several matrix variables. These take the form of trace polynomials: polynomial-like expressions…

The nilpotent graph of a group $G$ is the simple and undirected graph whose vertices are the elements of $G$ and two distinct vertices are adjacent if they generate a nilpotent subgroup of $G$. Here we discuss some topological properties of…

Let F be a local field of positive characteristic, and let G be either a Heisenberg group over F, or a certain (nonabelian) two-dimensional unipotent group over F. If H is an arithmetic subgroup of G, we provide an explicit description of…

The aim of this short note is to draw attention to a method by which the partition function and marginal probabilities for a certain class of random fields on complete graphs can be computed in polynomial time. This class includes Ising…

Lewis, Reiner, and Stanton conjectured a Hilbert seriesfor a space of invariants under an action of finite general linear groups using $(q,t)$-binomial coefficients. This work gives an analog in positive characteristic of theorems relating…

We consider some combinatorial problems on matrix polynomials over finite fields. Using results from control theory we give a proof of a result of Helmke, Jordan and Lieb on the number of linear unimodular matrix polynomials over a finite…

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…