English
Related papers

Related papers: Symmetric Word Equations in Two Positive Definite …

200 papers

We give a short and elementary proof of a theorem of Procesi, Schacher and (independently) Gondard, Ribenboim that generalizes a famous result of Artin. Let $A$ be an $n \times n$ symmetric matrix with entries in the polynomial ring…

Rings and Algebras · Mathematics 2007-05-23 Christopher J. Hillar , Jiawang Nie

The possibility of spherically symmetric solutions in bi-metric theory of gravity is examined. It is shown that two possible black hole type solutions exists in the model. Spherically symmetric solution of general theory of relativity is…

General Relativity and Quantum Cosmology · Physics 2014-03-28 Anoop Narayanan P E , P K Suresh

Two types of finite series of products of harmonic numbers involving nonnegative integer powers are evaluated, also yielding two other important harmonic number identities. The recursion formulas for these sums are derived, which are easily…

Number Theory · Mathematics 2012-02-23 Maarten Kronenburg

We construct a word-theoretic framework for generalized Markov numbers, that is, positive integers appearing in positive integer solutions of the generalized Markov equation $x^2+y^2+z^2+k_1yz+k_2zx+k_3xy=(3+k_1+k_2+k_3)xyz$. For each…

Number Theory · Mathematics 2026-05-29 Yasuaki Gyoda

In [V. M. Abramov, \emph{Bull. Aust. Math. Soc.} \textbf{104} (2021), 108--117] the fixed point equation for an infinite nonnegative Toeplitz matrix has been studied. It was found the conditions for existence of a positive solution and…

Classical Analysis and ODEs · Mathematics 2022-11-10 Vyacheslav M. Abramov

We employ the fact certain divided differences can be written as weighted means of B-splines and hence are positive. These divided differences include the complete homogeneous symmetric polynomials of even degree $2p$, the positivity of…

Combinatorics · Mathematics 2021-02-05 Albrecht Boettcher , Stephan Ramon Garcia , Mohamed Omar , Christopher O'Neill

In this article we consider the question of the existence of positive symmetric solutions to the problems of the following type $\Delta u=a\left( \left\vert x\right\vert \right) h\left( u\right) +b\left( \left\vert x\right\vert \right)…

Optimization and Control · Mathematics 2018-01-09 Dragos-Patru Covei

A common theme in mathematics is to define generalized solutions to deal with problems that potentially do not have solutions. A classical example is the introduction of least squares solutions via the normal equations associated with a…

Optimization and Control · Mathematics 2013-06-10 Heinz H. Bauschke , Warren L. Hare , Walaa M. Moursi

For a group G and a positive integer n write B_n(G) = {x \in G : |x^G | \le n}. If s is a positive integer and w is a group word, say that G satisfies the (n,s)-covering condition with respect to the word w if there exists a subset S of G…

Group Theory · Mathematics 2024-01-04 Eloisa Detomi , Marta Morigi , Pavel Shumyatsky

A matrix is totally positive if all of its minors are positive. This notion of positivity coincides with the type A version of Lusztig's more general total positivity in reductive real-split algebraic groups. Since skew-symmetric matrices…

Combinatorics · Mathematics 2024-12-24 Jonathan Boretsky , Veronica Calvo Cortes , Yassine El Maazouz

A prefix normal word is a binary word whose prefixes contain at least as many 1s as any of its factors of the same length. Introduced by Fici and Lipt\'ak in 2011 the notion of prefix normality is so far only defined for words over the…

Formal Languages and Automata Theory · Computer Science 2021-04-20 Yannik Eikmeier , Pamela Fleischmann , Mitja Kulczynski , Dirk Nowotka

Let $A_i$ and $B_i$ be positive definite matrices for every $i=1,\cdots,m.$ Let $Z=[Z_{ij}]$ be the block matrix, where $Z_{ij}=B_i^{^\frac{1}{_2}}\left(\displaystyle\sum_{k=1}^mA_k\right)B_j^{^\frac{1}{_2}}$ for every $ i,j=~1,\cdots,m$.…

Functional Analysis · Mathematics 2024-01-02 Shaima'a Freewan , Mostafa Hayajneh

The idempotent problem of a finitely generated inverse semigroup is the formal language of all words over the generators representing idempotent elements. This note proves that a finitely generated inverse semigroup with regular idempotent…

Group Theory · Mathematics 2013-03-22 Mark Kambites

A deterministic finite automaton is said to be synchronizing if it has a reset word, i.e. a word that brings all states of the automaton to a particular one. We prove that it is a PSPACE-complete problem to check whether the language of…

Formal Languages and Automata Theory · Computer Science 2014-05-15 Marina Maslennikova

We give a brief survey of recent results on word maps on simple groups and polynomial maps on simple associative and Lie algebras. Our focus is on parallelism between these theories, allowing one to state many new open problems and giving…

Group Theory · Mathematics 2013-04-19 Alexey Kanel-Belov , Boris Kunyavskii , Eugene Plotkin

We introduce and study the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be…

Group Theory · Mathematics 2018-01-03 Sergei V. Ivanov

Let $A, B$ be positive definite matrices, $p=1, 2$ and $r\ge 0$. It is shown that \begin{equation*} ||A+ B + r(A\sharp_t B+A\sharp_{1-t} B)||_p \le ||A+ B + r(A^{t}B^{1-t} + A^{1-t}B^t)||_p. \end{equation*} We also prove that for positive…

Functional Analysis · Mathematics 2016-05-12 Dinh Trung Hoa

We prove an asymptotic equidistribution result for word values for words with constants in the symmetric group. We also speculate about simultaneous asymptotic equidistribution results for values of $d$-tuples of elements of $\mathbb F_d$.

Group Theory · Mathematics 2025-07-21 Vadim Alekseev , Jakob Schneider , Andreas Thom

In this note, we give a necessary and sufficient condition for a matrix A in M to be finitely G-determined, where M is the ring of 2 x 2 matrices whose entries are formal power series over an infinite field, and G is a group acting on M by…

Algebraic Geometry · Mathematics 2020-09-18 Thuy Huong Pham , Pedro Macias Marques

A binary word is a map W : N --> {0,1}, and the set of factors of W with length n is F_n(W):={(W(i),W(i+1),...,W(i+n-1)) : i >= 0}. A word is Sturmian if |F_n(W)|=n+1 for every n>0. We show that the sum of the heights (also known as hamming…

Combinatorics · Mathematics 2007-05-23 Kevin O'Bryant
‹ Prev 1 8 9 10 Next ›