中文
相关论文

相关论文: Diameters of endomorphism monoids of chains

200 篇论文

For a semigroup $S$ whose universal right congruence is finitely generated (or, equivalently, a semigroup satisfying the homological finiteness property of being type right-$FP_1$), the right diameter of $S$ is a parameter that expresses…

In this paper, we characterize the monoid of endomorphisms of the semigroup of all oriented full transformations of a finite chain, as well as the monoid of endomorphisms of the semigroup of all oriented partial transformations and the…

环与代数 · 数学 2022-07-27 De Biao Li , Vítor H. Fernandes

In this paper, we characterize the monoid of endomorphisms of the semigroup of all monotone full transformations of a finite chain, as well as the monoids of endomorphisms of the semigroup of all monotone partial transformations and of the…

环与代数 · 数学 2022-05-04 De Biao Li , Vítor H. Fernandes

A topological monoid is isomorphic to an endomorphism monoid of a countable structure if and only if it is separable and has a compatible complete ultrametric such that composition from the left is non-expansive. We also give a topological…

逻辑 · 数学 2018-10-16 Manuel Bodirsky , Friedrich Martin Schneider

In this paper we consider endomorphisms of a finite directed path from monoid generators perspective. Our main aim is to determine the rank of the monoid $\wEnd\vec{P}_n$ of all weak endomorphisms of a directed path with $n$ vertices, which…

环与代数 · 数学 2021-12-28 Vítor Hugo Fernandes , Tânia Paulista

We establish new results concerning endomorphisms of a finite chain if the cardinality of the image of such endomorphism is no more than some fixed number k. The semiring of all such endomorphisms can be seen as a k - simplex whose vertices…

环与代数 · 数学 2013-05-01 Ivan Dimitrov Trendafilov

The group $\text{Diff}(\mathcal{M})$ of diffeomorphisms of a closed manifold $\mathcal{M}$ is naturally equipped with various right-invariant Sobolev norms $W^{s,p}$. Recent work showed that for sufficiently weak norms, the geodesic…

微分几何 · 数学 2021-02-12 Martin Bauer , Cy Maor

In this paper we consider endomorphisms of an undirected cycle graph from Semigroup Theory perspective. Our main aim is to present a process to determine sets of generators with minimal cardinality for the monoids $wEnd(C_n)$ and $End(C_n)$…

环与代数 · 数学 2023-10-09 Ilinka Dimitrova , Vítor H. Fernandes , Jörg Koppitz , Teresa M. Quinteiro

The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…

组合数学 · 数学 2014-11-27 Steffen Borgwardt , Jesús A. De Loera , Elisabeth Finhold

Let $G$ be a group. The directed endomorphism graph, $\dend(G)$ of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex $a$ to the vertex $b$ if $a \neq b$ and there exists an endomorphism on $G$ mapping…

A group is said to be bounded if it has a finite diameter with respect to any bi-invariant metric. In the present paper we discuss boundedness of various groups of diffeomorphisms.

群论 · 数学 2011-02-01 D. Burago , S. Ivanov , L. Polterovich

In this paper we study the widely considered endomorphisms and weak endomorphisms of a finite undirected path from monoid generators perspective. Our main aim is to determine the ranks of the monoids $wEnd P_n$ and $End P_n$ of all weak…

环与代数 · 数学 2021-11-25 Ilinka Dimitrova , Vítor H. Fernandes , Jörg Koppitz , Teresa M. Quinteiro

We establish new results concerning endomorphisms of a finite chain if the cardinality of the image of such endomorphism is no more than some fixed number. The semiring of all such endomorphisms can be seen as a simplex whose vertices are…

环与代数 · 数学 2015-06-18 Ivan Trendafilov

Given a set of endomorphisms on $\mathbb{P}^N$, we establish an upper bound on the number of points of bounded height in the associated monoid orbits. Moreover, we give a more refined estimate with an associated lower bound when the monoid…

数论 · 数学 2020-07-07 Wade Hindes

The metric dimension of a graph is the size of the smallest set of vertices whose distances distinguish all pairs of vertices in the graph. We show that this graph invariant may be calculated by an algorithm whose running time is linear in…

数据结构与算法 · 计算机科学 2015-06-11 David Eppstein

We prove that every permutation of a Cartesian product of two finite sets can be written as a composition of three permutations, the first of which only modifies the left projection, the second only the right projection, and the third again…

群论 · 数学 2019-01-18 Ville Salo

It is proved that the fixed point submonoid and the periodic point submonoid of a trace monoid endomorphism are always finitely generated. Considering the Foata normal form metric on trace monoids and uniformly continuous endomorphisms, a…

群论 · 数学 2012-11-20 Pedro V. Silva , Emanuele Rodaro

We prove that if $u:K \rightarrow M$ is a left minimal extension, then there exists an isomorphism between two subrings, $\textrm{End}_R^M(K)$ and $\textrm{End}_R^K(M)$ of $\textrm{End}_R(K)$ and $\textrm{End}_R(M)$ respectively, modulo…

Let $X$ be a finite or infinite chain and let $O(X)$ be the monoid of all endomorphisms of $X$. In this paper, we describe the largest regular subsemigroup of $O(X)$ and Green's relations on $O(X)$. In fact, more generally, if $Y$ is a…

We compute the chains associated to the left-invariant CR structures on the three-sphere. These structures are characterized by a single real modulus $a$. For the standard structure $a=1$, the chains are well-known and are closed curves. We…

复变函数 · 数学 2008-06-16 Alex L. Castro , Richard Montgomery
‹ 上一页 1 2 3 10 下一页 ›