Related papers: Equations in polyadic groups
In this paper we begin the systematic study of group equations with abelian predicates in the main classes of groups where solving equations is possible. We extend the line of work on word equations with length constraints, and more…
The functional equation f(p(z))=g(q(z)) is studied, where p,q are polynomials and f,g are trancendental meromorphic functions in C. We find all the pairs p,q for which there exist nonconstant f,g satisfying our equation and there exist no…
A monic polynomial $f(x)\in {\mathbb Z}[x]$ of degree $N$ is called monogenic if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$, where…
In math.GR/0510298, we showed that every loop isotopic to an F-quasigroup is a Moufang loop. Here we characterize, via two simple identities, the class of F-quasigroups which are isotopic to groups. We call these quasigroups FG-quasigroups.…
Let S be a Noetherian scheme, f:X->Y a surjective S-morphism of S-schemes, with X of finite type over S. We discuss what makes Y of finite type. First, we prove that if S is excellent, Y is reduced, and f is universally open, then Y is of…
For a finite abelian group $G$, let $\beta_{\mathrm{sep}}(G)$ denote its separating Noether number. We determine $\beta_{\mathrm{sep}}(G)$ exactly for every finite abelian group $ G \cong C_{n_1}\oplus \cdots \oplus C_{n_r}$ with $ 1<n_1…
The theory of standard bases in polynomial rings with coefficients in a ring R with respect to local orderings is developed. R is a commutative Noetherian ring with 1 and we assume that linear equations are solvable in R.
It is proven that for any representation over a field of characteristic 0 of the non-abelian semidirect product of a cyclic group of prime order p and the group of order 3 the corresponding algebra of polynomial invariants is generated by…
A linear configuration is said to be common in a finite Abelian group $G$ if for every 2-coloring of $G$ the number of monochromatic instances of the configuration is at least as large as for a randomly chosen coloring. Saad and Wolf…
Let A be a unitary algebra and G be a finite abelian group. Then a G-graded algebra is merely a G-algebra and viceversa because of the fact that G and its group of characters G* are isomorphic. This fact is no longer true if we substitute G…
This article is about equationally Noetherian and weak equationally Noetherian property of Ershov algebras. Here we show two canonical forms of the system of equations over Ershov algebras and two criteria of equationally Noetherian and…
The monadic theory of $(\mathbb R,\le)$ with quantification restricted to Borel sets is decidable. The Boolean combinations of $F_\sigma$ sets form an elementary substructure of the Borel sets. Under determinacy hypotheses, the proof…
Constructions are given of Noetherian maximal orders that are finitely presented algebras over a field K, defined by monomial relations. In order to do this, it is shown that the underlying homogeneous information determines the algebraic…
We study in detail the profinite group G arising as geometric \'etale iterated monodromy group of an arbitrary quadratic polynomial over a field of characteristic different from two. This is a self-similar closed subgroup of the group of…
The polyadic integer numbers, which form a polyadic ring, are representatives of a fixed congruence class. The basics of polyadic arithmetic are presented: prime polyadic numbers, the polyadic Euler function, polyadic division with a…
For any polynomial mapping $F=(F_1,\dots ,F_n)$ of $\Cal C^n$ with a finite number of zeros we define the Noether exponent $\nu(F)$. We prove the Jacobi formula for all polynomials of degree strictly less than $\sum_{i=1}^n (\deg…
In this note, we prove that if $A$ is a finite set of real numbers such that $|AA| = K|A|$, then for every polynomial $f \in \mathbb{R}[x,y]$ we have that $|f(A,A)| = \Omega_{K,\operatorname{deg} f}(|A|^2)$, unless $f$ is of the form…
Symmetric Grothendieck polynomials are inhomogeneous versions of Schur polynomials that arise in combinatorial $K$-theory. A polynomial has saturated Newton polytope (SNP) if every lattice point in the polytope is an exponent vector. We…
We classify general systems of polynomial equations with a single solution, or, equivalently, collections of lattice polytopes of minimal positive mixed volume. As a byproduct, this classification provides an algorithm to evaluate the…
Let $G$ be a finite group acting on a finite dimensional complex vector space $V$ via linear transformations. Let $\mathbb{C}[V]^G$ be the algebra of polynomials that are invariant under the induced $G$-action on the polynomial ring…