Related papers: Symmetric Word Equations in Two Positive Definite …
A longstanding question of Gromov asks whether every one-ended word-hyperbolic group contains a subgroup isomorphic to the fundamental group of a closed hyperbolic surface. An infinite family of word-hyperbolic groups can be obtained by…
Recent developemnts in string compactifications in the presence of antisymmetric field backgrounds suggest a new simple and predictive structure for soft terms in the MSSM depending only on two parameters. They give rise to a positive…
We consider questions related to the structure of infinite words (over an integer alphabet) with bounded additive complexity, i.e., words with the property that the number of distinct sums exhibited by factors of the same length is bounded…
In this article, we solve some word equations originated from discrete dynamical systems related to antisymmetric cubic map. These equations emerge when we work with primitive and greatest words. We conclude with some applications
In this work we study the spherical symmetric solutions of $f(R)$ gravity in the metric formalism. We show that for a generic $f(R)$ gravity, the spherical symmetric solution is consistent with the modified gravity equations except in the…
This paper establishes that every positive-definite matrix can be written as a positive linear combination of outer products of integer-valued vectors whose entries are bounded by the geometric mean of the condition number and the dimension…
If w is a word in d>1 letters and G is a finite group, evaluation of w on a uniformly randomly chosen d-tuple in G gives a random variable with values in G, which may or may not be uniform. It is known that if G ranges over finite simple…
The square-free word problem relative to a system of two defining relations is decidable.
A real symmetric matrix (resp., tensor) is said to be copositive if the associated quadratic (resp., homogeneous) form is greater than or equal to zero over the nonnegative orthant. The problem of detecting their copositivity is NP-hard.…
We give conditions for when the tensor product of two positive maps between matrix algebras is a positive map. This happens when one map belongs to a symmetric mapping cone and the other to the dual cone. Necessary and sufficient conditions…
We give new characterizations of sofic groups: -- A group $G$ is sofic if and only if it is a subgroup of a quotient of a direct product of alternating or symmetric groups. -- A group $G$ is sofic if and only if any system of equations…
Smooth words over an alphabet of non-negative integers $\{a,b\}$ are infinite words that are infinitely derivable, the most famous example being the Oldenburger-Kolakoski word over $\{1,2\}$. The main way to study their language is to…
In the lambda calculus a term is solvable iff it is operationally relevant. Solvable terms are a superset of the terms that convert to a final result called normal form. Unsolvable terms are operationally irrelevant and can be equated…
We extend Borel's theorem on the dominance of word maps from semisimple algebraic groups to some perfect groups. In another direction, we generalize Borel's theorem to some words with constants. We also consider the surjectivity problem for…
Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…
We show that the Word Problem in finitely generated subgroups of $\textsf{GL}_d(\mathbb{Z})$ can be solved in linear average-case complexity. This is done under the bit-complexity model, which accounts for the fact that large integers are…
It is well-known that $AB$ and $BA$ are similar when $A$ and $B$ are complex square Hermitian matrices. In this note we answer a question of F. Zhang by demonstrating that similarity can fail if $A$ is Hermitian and $B$ is normal. Perhaps…
This paper is concerned with the positive definite solutions to the matrix equation $X+A^{\mathrm{H}}\bar{X}^{-1}A=I$ where $X$ is the unknown and $A$ is a given complex matrix. By introducing and studying a matrix operator on complex…
A word equation with one variable in a free group is given as $U = V$, where both $U$ and $V$ are words over the alphabet of generators of the free group and $X, X^{-1}$, for a fixed variable $X$. An element of the free group is a solution…
In 1995, Reznick showed an important variant of the obvious fact that any positive semidefinite (real) quadratic form is a sum of squares of linear forms: If a form (of arbitrary even degree) is positive definite then it becomes a sum of…