Related papers: Word maps, polynomial maps and image ratios
The complexity function of an infinite word $w$ on a finite alphabet $A$ is the sequence counting, for each non-negative $n$, the number of words of length $n$ on the alphabet $A$ that are factors of the infinite word $w$. For any given…
A group-word w is called concise if whenever the set of w-values in a group G is finite it always follows that the verbal subgroup w(G) is finite. More generally, a word w is said to be concise in a class of groups X if whenever the set of…
$\omega$-clones are multi-sorted structures that naturally emerge as algebras for infinite trees, just as $\omega$-semigroups are convenient algebras for infinite words. In the algebraic theory of languages, one hopes that a language is…
The information in an individual finite object (like a binary string) is commonly measured by its Kolmogorov complexity. One can divide that information into two parts: the information accounting for the useful regularity present in the…
Consider a set of integers $\mathscr A$ having finite diameter $X$, and a system of simultaneous polynomial equations to be solved over $\mathscr A$. In many circumstances, it is known that the number of solutions of this system is…
We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…
Let $f_1(x),\ldots,f_n(x)$ be some polynomials. The upper bound on the number of $x\in\mathbb F_p$ such that $f_1(x),\ldots,f_n(x)$ are roots of unit of order $t$ is obtained. This bound generalize the bound of the paper \cite{V-S} to the…
We provide the first examples of words in the free group of rank 2 which are not proper powers and for which the corresponding word maps are non-surjective on an infinite family of finite non-abelian simple groups.
The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…
Suppose $A=k[X_1, X_2, \ldots, X_n]$ is a polynomial ring over a field $k$ and $I$ is an ideal in $A$. Then M. P. Murthy conjectured that $\mu(I)=\mu(I/I^2)$, where $\mu$ denotes the minimal number of generators. Recently, Fasel \cite{F}…
Given an open, bounded, planar set $\Omega$, we consider its $p$-Cheeger sets and its isoperimetric sets. We study the set-valued map $\mathfrak{V}:[\frac12,+\infty)\rightarrow\mathcal{P}((0,|\Omega|])$ associating to each $p$ the set of…
We introduce and carefully study a natural probability measure over the numerical range of a complex matrix $A \in M_n(\C)$. This numerical measure $\mu_A$ can be defined as the law of the random variable $<AX,X> \in \C$ when the vector $X…
Let $\mathbf{O}(\mathbb{F})$ be the split octonion algebra over an algebraically closed field $\mathbb{F}$. For positive integers $k_1, k_2\geq 2$, we study surjectivity of the map $A_1(x^{k_1}) + A_2(y^{k_2}) \in…
A commutative ring R is said to be coverable if it is the union of its proper subrings and said to be finitely coverable if it is the union of a finite number of them. In the latter case, we denote by {\sigma}(R) the minimal number of…
The regular objects in various categories, such as maps, hypermaps or covering spaces, can be identified with the normal subgroups N of a given group \Gamma, with quotient group isomorphic to \Gamma/N. It is shown how to enumerate such…
In this paper, we analyze the density of the Fibonacci word and its derived forms by examining the morphisms associated with each. It offers a comparative analysis of the density of Fibonacci numbers alongside other words derived from…
We prove that every mapping torus of any free group endomorphism is residually finite. We show how to use a not yet published result of E. Hrushovski to extend our result to arbitrary linear groups. The proof uses algebraic self-maps of…
We offer a criterion for showing that the automorphism group of an ultrahomogeneous structure is topologically 2-generated and even has a cyclically dense conjugacy class. We then show how finite topological rank of the automorphism group…
A relative one-relator presentation has the form P = < X,H ; R > where X is a set, H is a group, and R is a group word on X and H. We show that if the group word on X obtained from R by deleting all the terms from H has what we call the…
We define a new class of languages of $\omega$-words, strictly extending $\omega$-regular languages. One way to present this new class is by a type of regular expressions. The new expressions are an extension of $\omega$-regular expressions…