English
Related papers

Related papers: Isomorphic and Strongly Connected Components

200 papers

There are a variety of ways to associate directed or undirected graphs to a group. It may be interesting to investigate the relations between the structure of these graphs and characterizing certain properties of the group in terms of some…

Group Theory · Mathematics 2017-05-23 A. R. Moghaddamfar , S. Rahbariyan , W. J. Shi

We say that a (countably dimensional) topological vector space $X$ is orbital if there is $T\in L(X)$ and a vector $x\in X$ such that $X$ is the linear span of the orbit ${T^nx:n=0,1,...}$. We say that $X$ is strongly orbital if,…

Functional Analysis · Mathematics 2012-09-06 Stanislav Shkarin

We show that the order dimension of the weak order on a Coxeter group of type A, B or D is equal to the rank of the Coxeter group, and give bounds on the order dimensions for the other finite types. This result arises from a unified…

Combinatorics · Mathematics 2026-05-13 Nathan Reading

In the In recent times, the research community has explored diverse structures and novel fabrication methods for amorphous solids. This work investigates structural trends among different classes of amorphous materials to identify universal…

Partial connections are (singular) differential systems generalizing classical connections on principal bundles, yielding analogous decompositions for manifolds with nonfree group actions. Connection forms are interpreted as maps…

Differential Geometry · Mathematics 2007-05-23 Debra Lewis , Nilima Nigam , Peter Olver

We study algebraic properties of the semigroup $\mathscr{O\!\!I\!}_n(L)$ of finite partial order isomorphisms of the rank $\leq n$ of an infinite linearly ordered set $(L,\leqslant)$. In particular we describe its idempotents, the natural…

Group Theory · Mathematics 2024-12-31 Oleg Gutik , Maksym Shchypel

For an algebraic stack $\sX$ flat and of finite presentation over a scheme $S$, we introduce various notions of {\em relative connected components} and {\em relative irreducible components}. The main distinction between these notions is…

Algebraic Geometry · Mathematics 2010-02-18 Matthieu Romagny

Orbits of automorphism groups of partially ordered sets are not necessarily congruence classes, i.e. images of an order homomorphism. Based on so-called orbit categories a framework of factorisations and unfoldings is developed that…

Group Theory · Mathematics 2021-05-26 Tobias Schlemmer

Any planar shape $P\subset \mathbb{C}$ can be embedded isometrically as part of the boundary surface $S$ of a convex subset of $\mathbb{R}^3$ such that $\partial P$ supports the positive curvature of $S$. The complement $Q = S \setminus P$…

Dynamical Systems · Mathematics 2016-12-02 Laura DeMarco , Kathryn Lindsey

Let $G=(V,E)$ be a finite undirected graph. If $P$ is an oriented path from $r_1\in V$ to $r_2\in V$, we define $\partial(P) = r_2-r_1$. If $R, S\subseteq V$, we denote by $P(G; R, S)$ the span of the set of all $\partial P\otimes \partial…

Combinatorics · Mathematics 2019-04-19 Guantao Chen , Serguei Norine , Robin Thomas , Hein van der Holst

The idempotent semigroups (bands) that give rise to partial orders by defining $a \leq b \iff a \cdot b = a$ are the "right-regular" bands (RRB), which are axiomatized by $x\cdot y \cdot x = y \cdot x$. In this work we consider the class of…

Logic · Mathematics 2024-09-02 Joel Kuperman , Alejandro Petrovich , Pedro Sánchez Terraf

We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…

Probability · Mathematics 2009-03-06 Eugenijus Manstavičius

We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…

It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…

Logic · Mathematics 2016-09-07 Martin Goldstern , Saharon Shelah

Given a symmetric monoidal category $C$ with product $\sqcup$, where the neutral element for the product is an initial object, we consider the poset of $\sqcup$-complemented subobjects of a given object $X$. When this poset has finite…

Combinatorics · Mathematics 2025-07-30 Kevin Ivan Piterman , Volkmar Welker

Let G be a connected, compact, semisimple Lie group. It is known that for a compact closed orientable surface $\Sigma$ of genus $l >1$, the order of the group $H^2(\Sigma,\pi_1(G))$ is equal to the number of connected components of the…

Symplectic Geometry · Mathematics 2007-05-23 Nan-Kuo Ho , Chiu-Chu Melissa Liu

Sectional pseudocomplementation (sp-complementation) on a poset is a partial operation $*$ which associates with every pair $(x,y)$ of elements, where $x \ge y$, the pseudocomplement $x*y$ of $x$ in the upper section $[y)$. Any total…

Combinatorics · Mathematics 2022-11-02 Jānis Cīrulis

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

Combinatorics · Mathematics 2010-11-30 Robert Gray , Rognvaldur G. Moller

This paper characterizes which subsets of C^n can be the set of positions of n points on a linkage in the complex plane C. For example, assuming compactness they are just compact semialgebraic sets. Noncompact configuration spaces are…

Geometric Topology · Mathematics 2007-05-23 Henry C. King

A monoid $M$ generated by a set $S$ of symbols can be described as the set of equivalence classes of finite words in $S$ under some relations that specify when some contiguous sequence of symbols can be replaced by another. If $a,b\in S$, a…

Combinatorics · Mathematics 2011-01-26 Matthew J. Samuel