相关论文: Words for generalized Markov numbers

We introduce a new notion of "regularity structure" that provides an algebraic framework allowing to describe functions and / or distributions via a kind of "jet" or local Taylor expansion around each point. The main novel idea is to…

We consider the $*$-Markov equation for the symmetric Laurent polynomials in three variables with integer coefficients, which is an equivariant analog of the classical Markov equation for integers. We study how the properties of the Markov…

An analysis of the Markov tree is presented. Markov triplets, {x,R,z}, are the positive integer solutions to the Diophantine equation x2 + R2 + z2 = 3xRz. Inspired by patterns of the Fibonacci and Pell triplets in Region 1 and Region 2 of…

Generalized Pl\"ucker numbers are defined to count certain types of tangent lines of generic degree $d$ complex projective hypersurfaces. They can be computed by identifying them as coefficients of GL(2)-equivariant cohomology classes of…

We prove a generalisation of Vinogradov's theorem by finding for $m\geqslant 3$ and fixed positive integers $c_1, \dots ,c_m, r_1, \dots , r_m$ the asymptotics of the number of sequences $(n_1, \dots ,n_m) \in \mathbf{N}^{m}$ such that…

We describe a framework for inducing probabilistic grammars from corpora of positive samples. First, samples are {\em incorporated} by adding ad-hoc rules to a working grammar; subsequently, elements of the model (such as states or…

We present a general expression for any term of the Magnus series as an iterated integral of a linear combination of independent right-nested commutators with given coefficients. The relation with the Malvenuto--Reutenauer Hopf algebra of…

Building on work of Maltsev on locally free algebras in finite purely functional languages, we revisit the model theory of (absolutely free) term algebras and their completions. Maltsev's analysis yields a natural axiomatization together…

As a generalization of polyominoes we consider edge-to-edge connected nonoverlapping unions of regular $k$-gons. For $n\le 4$ we determine formulas for the number $a_k(n)$ of generalized polyominoes consisting of $n$ regular $k$-gons.…

We provide an algorithmic framework for the computation of explicit representing matrices for all irreducible representations of a generalized symmetric group $\Grin_n$, i.e., a wreath product of cyclic group of order $r$ with the symmetric…

Markov combination is an operation that takes two statistical models and produces a third whose marginal distributions include those of the original models. Building upon and extending existing work in the Gaussian case, we develop Markov…

We extend the concept of Krylov complexity to include general unitary evolutions involving multiple generators. This generalization enables us to formulate a framework for generalized Krylov complexity, which serves as a measure of the…

In this paper we discourse basises of representable algebras. This question lead to arithmetic problems. We prove algorithmical solvability of exponential-Diophantine equations in rings represented by matrices over fields of positive…

We extend the Markov chain tree theorem to general commutative semirings, and we generalize the state reduction algorithm to commutative semifields. This leads to a new universal algorithm, whose prototype is the state reduction algorithm…

The generalized Markov equations are deeply connected with the generalized cluster algebras of Markov type. We construct a deformed Fock-Goncharov tropicalization for the generalized Markov equations and prove that their tropicalized tree…

New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…

A new generalized matrix inverse is derived which is consistent with respect to arbitrary nonsingular diagonal transformations, e.g., it preserves units associated with variables under state space transformations, thus providing a general…

There is proposed the Maillet--Malgrange type theorem for a generalized power series (having complex power exponents) formally satisfying an algebraic ordinary differential equation. The theorem describes the growth of the series…

We give a simpler proof using automata theory of a recent result of Kapovich, Weidmann and Myasnikov according to which so-called benign graphs of groups preserve decidability of the generalized word problem. These include graphs of groups…

In this paper, we generalize the Lyndon-Shirshov words to Lyndon-Shirshov $\Omega$-words on a set $X$ and prove that the set of all non-associative Lyndon-Shirshov $\Omega$-words forms a linear basis of the free Lie $\Omega$-algebra on the…