相关论文: Stable Invariants of Words from Random Matrices

In this paper we propose a new, more appropriate definition of regular and indeterminate strings. A regular string is one that is "isomorphic" to a string whose entries all consist of a single letter, but which nevertheless may itself…

A double occurrence word $w$ over a finite alphabet $\Sigma$ is a word in which each alphabet letter appears exactly twice. Such words arise naturally in the study of topology, graph theory, and combinatorics. Recently, double occurrence…

A binary word is Sturmian if the occurrences of each letter are balanced, in the sense that in any two factors of the same length, the difference between the number of occurrences of the same letter is at most 1. In digital geometry,…

A new nonparametric approach for system identification has been recently proposed where the impulse response is seen as the realization of a zero--mean Gaussian process whose covariance, the so--called stable spline kernel, guarantees that…

A noncommutative polynomial is stable if it is nonsingular on all tuples of matrices whose imaginary parts are positive definite. In this paper a characterization of stable polynomials is given in terms of strongly stable linear matrix…

Let $w=w(x_1,\ldots,x_r)$ be a lower central word or a derived word. We show that the word $w(u_1,\ldots,u_r)$ is concise whenever $u_1,\ldots,u_r$ are non-commutator words in disjoint sets of variables, thus proving a generalized version…

The Fundamental Theorem of Language Change (Yang, 2000) implies the impossibility of stable variation in the Variational Learning framework, but only in the special case where two, and not more, grammatical variants compete. Introducing the…

We examine from an invariant theory viewpoint the monoid algebras for two monoids having large symmetry groups. The first monoid is the free left-regular band on $n$ letters, defined on the set of all injective words, that is, the words…

The factor complexity function $C_w(n)$ of a finite or infinite word $w$ counts the number of distinct factors of $w$ of length $n$ for each $n \ge 0$. A finite word $w$ of length $|w|$ is said to be trapezoidal if the graph of its factor…

In 1994, Witten has defined a monopole invariant and he has shown the equivalence of this invariant with Donaldson's polynomial using his result in \( \SS \)-duality. This new invariant is very powerful because the gauge group is abelian.…

We study toroidal orbifold models with topologically invariant terms in the path integral formalism and give physical interpretations of the terms from an operator formalism point of view. We briefly discuss a possibility of a new class of…

Here we introduce some new classes of discrete stable random variables, which are useful for understanding of a new general notion of stability of random variables called us as casual stability. There are given some examples of casual and…

We give an algorithm to compute stable commutator length in free products of cyclic groups which is polynomial time in the length of the input, the number of factors, and the orders of the finite factors. We also describe some experimental…

For a fixed regular language $L$, the enumeration of $L$-infixes is the following task: we are given an input word $w = a_1 \cdots a_n$ and we must enumerate the infixes of $w$ that belong to $L$, i.e., the pairs $i \leq j$ such that $a_i…

We extend the construction of multiplicative representations for a free group G introduced by Kuhn and Steger (Isr. J., (144) 2004) in such a way that the new class Mult(G) so defined is stable under taking the finite direct sum, under…

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…

The main theme of this paper is the enumeration of the occurrence of a pattern in words and permutations. We mainly focus on asymptotic properties of the sequence $f_r^v(k,n),$ the number of $n$-array $k$-ary words that contain a given…

The study of verbal subgroups within a group is well-known for being an effective tool to obtain structural information about a group. Therefore, conditions that allow the classification of words in a free group are of paramount importance.…

The introduction is modified in the revised version. Also, many typos and errors were corrected. Let $W\to C$ be degeneration of smooth varieties so that the special fiber has normal crossing singularity. In this paper, we first constructed…

We consider increasingly complex models of matrix denoising and dictionary learning in the Bayes-optimal setting, in the challenging regime where the matrices to infer have a rank growing linearly with the system size. This is in contrast…