中文
相关论文

相关论文: Finite Semigroups of Constant Rank, and the five B…

200 篇论文

There are several notions of size for semigroups that have natural analogues for partial semigroups. Among these are thick, syndetic, central, piecewise syndetic, IP, J, and the more recently introduced notion of combinatorially rich,…

组合数学 · 数学 2025-02-07 Arpita Ghosh , Neil Hindman

Every rotationless outer automorphism of a finite rank free group is represented by a particularly useful relative train track map called a CT. The main result of this paper is that the constructions of CTs can be made algorithmic. A key…

群论 · 数学 2017-06-07 Mark Feighn , Michael Handel

Pin proved that every circular automaton with a prime number of states containing a non-permutation is synchronizing. In this paper, we investigate the synchronization of circular semi-flower automata. We first prove that every semi-flower…

形式语言与自动机理论 · 计算机科学 2018-08-07 Shubh N. Singh , Ankit Raj

In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…

群论 · 数学 2020-07-23 Sandeep Dalal , Jitender Kumar

The finite basis property is often connected with the finite rank property, which it entails. Many examples have been produced of finite rank varieties which are not finitely based. In this note, we establish a result on nilpotent…

群论 · 数学 2019-03-18 J. Almeida , M. H. Shahzamanian

An $\mathcal{A}$-semigroup is a numerical semigroup without consecutive small elements. This work generalizes this concept to finite-complement submonoids of an affine cone $\mathcal{C}$. We develop algorithmic procedures to compute all…

交换代数 · 数学 2025-06-23 J. C. Rosales , R. Tapia-Ramos , A. Vigneron-Tenorio

Congruences for stochastic automata are defined, the correspondin factor automata are constructed and investigated for automata ove analytic spaces. We study the behavior under finite and infinite streams. Congruences consist of multiple…

形式语言与自动机理论 · 计算机科学 2020-11-16 Ernst-Erich Doberkat

Suppose that three kinds of quantum systems are given in some unknown states $\ket f^{\otimes N}$, $\ket{g_1}^{\otimes K}$, and $\ket{g_2}^{\otimes K}$, and we want to decide which \textit{template} state $\ket{g_1}$ or $\ket{g_2}$, each…

量子物理 · 物理学 2009-11-07 Masahide Sasaki , Alberto Carlini

We construct a machine which takes as input a locally small symmetric closed complete multicategory $\mathsf V$. And its output is again a locally small symmetric closed complete multicategory $\mathsf V\text-\mathcal{C}at$, the…

范畴论 · 数学 2024-10-29 Volodymyr Lyubashenko

The method of integrals of motion is used to construct families of generalized coherent states of a nonrelativistic spinless charged particle in a constant electric field. Families of states, differing in the values of their standard…

量子物理 · 物理学 2018-05-16 T. C. Adorno , A. S. Pereira

The category of quasi frames (or qframes) is introduced and studied. In the context of qframes we can jointly study problems related to the L-Surjunctivity and Stable Finiteness Conjectures. As a consequences of our main results, we can…

环与代数 · 数学 2018-01-17 Simone Virili

For a finite field k and a triple of integers g \ge r \ge s \ge 0, we count the number of semilinear endomorphisms of a g-dimensional k-vector space which have rank r and stable rank s. Such endomorphisms show up naturally in the…

代数几何 · 数学 2011-12-22 Timothy Holland

In this paper we prove that every pure-state $\Psi ^{(N)}$ of N (N$\geqslant 3)$ continuous variables corresponds to a pair of convex rigid covers (CRCs) structures in the continuous-dimensional Hilbert-Schmidt space. Next we strictly…

量子物理 · 物理学 2007-05-23 Zai-Zhe Zhong

The aim of this paper is to prove the \v{C}ern\'y conjecture and the rank conjecture for \v{C}ern\'y type automata and monoids. A transformation monoid is said to be \v{C}ern\'y type if it is generated by a simple idempotent and a regular…

形式语言与自动机理论 · 计算机科学 2025-02-03 Igor Rystsov

The paper is devoted to two types of algebraic models of automata. The usual (first type) model leads to the developed decomposition theory (Krohn-Rhodes theory). We introduce another type of automata model and study how these automata are…

形式语言与自动机理论 · 计算机科学 2015-06-22 Boris Plotkin , Tatjana Plotkin

Linear attention offers a computationally efficient yet expressive alternative to softmax attention. However, recent empirical results indicate that the hidden state of trained linear attention models often exhibits a low-rank structure,…

机器学习 · 计算机科学 2026-02-13 Philipp Nazari , T. Konstantin Rusch

We extend the concept of classicality in quantum optics to spin states. We call a state ``classical'' if its density matrix can be decomposed as a weighted sum of angular momentum coherent states with positive weights. Classical spin states…

量子物理 · 物理学 2010-06-23 Olivier Giraud , Petr Braun , Daniel Braun

We study the closure of the projection of the (nonconvex) cone of rank restricted positive semidefinite matrices onto subsets of the matrix entries. This defines the feasible sets for semidefinite completion problems with restrictions on…

最优化与控制 · 数学 2016-11-01 Ian Davidson , Henry Wolkowicz

Krohn-Rhodes theory encompasses the techniques for the study of finite automata and their decomposition into elementary automata. The famous result of Krohn and Rhodes roughly states that each finite automaton can be decomposed into…

形式语言与自动机理论 · 计算机科学 2020-11-02 Karl-Heinz Zimmermann

The operating point of a power system may change due to slow enough variations of the power injections. Rotating machines in the bulk system can absorb smooth changes in the dynamic states of the system. In this context, we present a novel…

最优化与控制 · 数学 2024-01-22 Gabriel Intriago , Holger Cevallos , Yu Zhang