相关论文: Word maps and Waring type problems

In the present paper, we study the finite type invariants of Gauss words. In the Polyak algebra techniques, we reduce the determination of the group structure to transformation of a matrix into its Smith normal form and we give the…

Recently the third named author defined a 2-parametric family of groups $G_n^k$ \cite{gnk}. Those groups may be regarded as a certain generalisation of braid groups. Study of the connection between the groups $G_n^k$ and dynamical systems…

Given a subset of states $S$ of a deterministic finite automaton and a word $w$, the preimage is the subset of all states mapped to a state in $S$ by the action of $w$. We study three natural problems concerning words giving certain…

One of our result is that 5 measurable sets in $R^8$ always admit an equipartition by 2 hyperplanes. This is an instance of a general equipartition problem (formulated by B. Gr{\" u}nbaum and H. Hadwiger) which can be reduced to the…

In this paper we investigate the word problem of the free Burnside semigroup satisfying x^2=x^3 and having two generators. Elements of this semigroup are classes of equivalent words. A natural way to solve the word problem is to select a…

For every natural number k we prove a decomposition theorem for bounded measurable functions on compact abelian groups into a structured part, a quasi random part and a small error term. In this theorem quasi randomness is measured with the…

Let $p$ be a polynomial in non-commutative variables $x_1,x_2,\ldots,x_n$ with constant term zero over an algebraically closed field $K$. The object of study in this paper is the image of this kind of polynomial over the algebra of upper…

We classify all groups G and all pairs (V,W) of absolutely simple Yetter-Drinfeld modules over G such that the support of the direct sum of V and W generates G, the square of the braiding between V and W is not the identity, and the Nichols…

The famous Prouhet-Tarry-Escott problem seeks collections of mutually disjoint sets of non-negative integers having equal sums of like powers. In this paper we present a new proof of the solution to this problem by deriving a generalization…

Math word problems form a natural abstraction to a range of quantitative reasoning problems, such as understanding financial news, sports results, and casualties of war. Solving such problems requires the understanding of several…

Fix a finite field $K$ of order $q$ and a word $w$ in a free group $F$ on $r$ generators. A $w$-random element in $GL_N(K)$ is obtained by sampling $r$ independent uniformly random elements $g_1,\ldots,g_r\in GL_N(K)$ and evaluating…

In combinatorics of words, a concatenation of $k$ consecutive equal blocks is called a power of order $k$. In this paper we take a different point of view and define an anti-power of order $k$ as a concatenation of $k$ consecutive pairwise…

In this paper, we consider a variant of the classical algorithmic problem of checking whether a given word $v$ is a subsequence of another word $w$. More precisely, we consider the problem of deciding, given a number $p$ (defining a…

We exhibit explicit and easily realisable bijections between Hecke--Kiselman monoids of type $A_n$/$\widetilde{A}_n$; certain braid diagrams on the plane/cylinder; and couples of integer sequences of particular types. This yields a fast…

The Donald--Flanigan problem for a finite group H and coefficient ring k asks for a deformation of the group algebra kH to a separable algebra. It is solved here for dihedral groups and for the classical Weyl groups (whose rational group…

Suppose that G is a nontrivial torsion-free group and w is a word in the alphabet G\cup\{x_1^{\pm1},...,x_n^{\pm1}\} such that the word w' obtained from w by erasing all letters belonging to G is not a proper power in the free group…

In this paper, we formally introduce the concept of a row-sum matrix over an arbitrary group $G$. When $G$ is cyclic, these types of matrices have been widely used to build uniform 2-factorizations of small Cayley graphs (or, Cayley…

The present article is focused on the study of a special class of systems of nonlinear transcendental equations for which classical algebraic and symbolic methods are inapplicable. For the purpose of the study of such systems, we develop a…

We consider a logical puzzle which we call double pouring problem, which was original defined for $k=3$ vessels. We generalize this definition to $k \ge 2 $ as follows. Each of the $k$ vessels contains an integer amount of water, called its…

A Lie polynomial is an element of a free Lie algebra $\mathcal F_k$ on $k$-generators, which defines a Lie map on a given Lie algebra $L$, by substituting $k$-elements of $L$. Similar to word maps on groups and polynomial maps on algebras,…