相关论文: Stable Invariants of Words from Random Matrices
We introduce the notion of unavoidable (complete) sets of word patterns, which is a refinement for that of words, and study certain numerical characteristics for unavoidable sets of patterns. In some cases we employ the graph of pattern…
We study the girth of Cayley graphs of finite classical groups G on random sets of generators. Our main tool is an essentially best possible bound we obtain on the probability that a given word w takes the value 1 when evaluated in G in…
The symbolic complexity of an infinite word $W$ is the function $p_W(l)$ counting the number of different subwords in $W$ of length $l$. In this paper our main purpose is to study the complexity for a class of topological dynamical systems,…
In this paper we introduce and study a new property of infinite words: An infinite word $x\in A^\mathbb{N}$, with values in a finite set $A$, is said to be $k$-self-shuffling $(k\geq 2)$ if $x$ admits factorizations: $x=\prod_{i=0}^\infty…
Multidimensional persistence studies topological features of shapes by analyzing the lower level sets of vector-valued functions. The rank invariant completely determines the multidimensional analogue of persistent homology groups. We prove…
A moduli space of stable quotients of the rank n trivial sheaf on stable curves is introduced. Over nonsingular curves, the moduli space is Grothendieck's Quot scheme. Over nodal curves, a relative construction is made to keep the torsion…
We give the definition and explore the algebraic structure of a class of quantum symmetries, called topological symmetries, which are generalizations of supersymmetry in the sense that they involve topological invariants similar to the…
Syntactic structures used to play a vital role in natural language processing (NLP), but since the deep learning revolution, NLP has been gradually dominated by neural models that do not consider syntactic structures in their design. One…
Swarm stability is concerned for descriptor compartmental networks with linear time-invariant protocol. Compartmental network is a specific type of dynamical multi-agent system. Necessary and sufficient conditions for both consensus and…
We give a precise, computable formula for comparing $\lambda$-invariants between modular forms in the anticyclotomic indefinite setting where the Selmer groups have positive rank. This is an improvement of Hatley-Lei \cite{HL19, HL21} where…
We study mathematical programs with switching constraints (MPSC)from the topological perspective. Two basic theorems from Morse theory are proved. Outside the W-stationary point set, continuous defor-mation of lower level sets can be…
In this paper, we study properties and patterns on permutations of multisets whose multivariate generating functions are symmetric. We interpret this phenomenon through the lens of group actions and define such a property or pattern as…
Meanings of words change over time and across domains. Detecting the semantic changes of words is an important task for various NLP applications that must make time-sensitive predictions. We consider the problem of predicting whether a…
For a stationary stochastic process $\{X_n\}$ with values in some set $A$, a finite word $w \in A^K$ is called a memory word if the conditional probability of $X_0$ given the past is constant on the cylinder set defined by $X_{-K}^{-1}=w$.…
Scale invariance profoundly influences the dynamics and structure of complex systems, spanning from critical phenomena to network architecture. Here, we propose a precise definition of scale-invariant networks by leveraging the concept of a…
In this paper, we study the stability of Property $(UW_E)$ under commuting finite rank perturbation in terms of spectrum induced by consistent in invertibility for operators and a variant of upper semi-Weyl spectrum. Also we discuss the…
Frobenius observed that the number of times an element of a finite group is obtained as a commutator is given by a specific combination of the irreducible characters of the group. More generally, for any word w the number of times an…
Stochastic symmetries and related invariance properties of finite dimensional SDEs driven by general c\`adl\`ag semimartingales taking values in Lie groups are defined and investigated. In order to enlarge the class of possible symmetries…
We develop a theory of polymatroids on Stallings core graphs, which provides a new technique for proving lower bounds on stable invariants of words and subgroups in free groups $F$, and for upper bounds on their probability for mapping,…
The words of a language are randomly replaced in time by new ones, but it has long been known that words corresponding to some items (meanings) are less frequently replaced than others. Usually, the rate of replacement for a given item is…