English
Related papers

Related papers: The Relation between Composability and Splittabili…

200 papers

We show in this paper that a split-comparability graph $G$ has chromatic index equal to $\Delta(G) + 1$ if and only if $G$ is neighborhood-overfull. That implies the validity of the Overfull Conjecture for the class of split-comparability…

Let $\sigma =\{\sigma_{i} | i\in I\}$ be some partition of the set of all primes $\Bbb{P}$ and $G$ a finite group. $G$ is said to be $\sigma$-soluble if every chief factor $H/K$ of $G$ is a $\sigma _{i}$-group for some $i=i(H/K)$. A set…

Group Theory · Mathematics 2017-04-11 Alexander N. Skiba

In this note we prove a selection of commutativity theorems for various classes of semigroups. For instance, if in a separative or completely regular semigroup $S$ we have $x^p y^p = y^p x^p$ and $x^q y^q = y^q x^q$ for all $x,y\in S$ where…

Group Theory · Mathematics 2021-01-19 Francisco Araújo , Michael Kinyon

A split graph is a graph whose vertex set can be partitioned into a clique and an independent set. A connected graph $G$ is said to be $t$-admissible if admits a special spanning tree in which the distance between any two adjacent vertices…

Combinatorics · Mathematics 2024-06-13 Fernanda Couto , Diego Amaro Ferraz , Sulamita Klein

A partition $(V_1,\ldots,V_k)$ of the vertex set of a graph $G$ with a (not necessarily proper) colouring $c$ is colourful if no two vertices in any $V_i$ have the same colour and every set $V_i$ induces a connected graph. The COLOURFUL…

Data Structures and Algorithms · Computer Science 2018-08-13 Laurent Bulteau , Konrad K. Dabrowski , Guillaume Fertin , Matthew Johnson , Daniel Paulusma , Stephane Vialette

Free products of two residually finite groups with amalgamated retracts are considered. It is proved that a cyclic subgroup of such a group is not finitely separable if, and only if, it is conjugated with a subgroup of a free factor which…

Group Theory · Mathematics 2013-08-19 P. A. Bobrovskii , E. V. Sokolov

We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…

Logic · Mathematics 2012-11-28 Mohammad Assem

The set splittability problem is the following: given a finite collection of finite sets, does there exits a single set that contains exactly half the elements from each set in the collection? (If a set has odd size, we allow the floor or…

Combinatorics · Mathematics 2019-09-17 Peter Bernstein , Cashous Bortner , Samuel Coskey , Shuni Li , Connor Simpson

For any link and for any modulus $m$ we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of the link, the equivalence class of a non-trivial m-coloring…

Geometric Topology · Mathematics 2017-05-11 Jun Ge , Slavik Jablan , Louis H. Kauffman , Pedro Lopes

For an arbitrary finite dimensional algebra $\Lambda$, we prove that any wide subcategory of $\mathsf{mod} \Lambda$ satisfying a certain finiteness condition is $\theta$-semistable for some stability condition $\theta$. More generally, we…

Representation Theory · Mathematics 2023-04-21 Toshiya Yurikusa

Isomorphisms p between pattern classes A and B are considered. It is shown that, if p is not a symmetry of the entire set of permutations, then, to within symmetry, A is a subset of one a small set of pattern classes whose structure,…

Combinatorics · Mathematics 2013-08-16 Michael Albert , M. D. Atkinson , Anders Claesson

There exist irreducible exact covering systems (ECS). These are ECS which are not a proper split of a coarser ECS. However, an ECS admiting a maximal modulus which is divisible by at most two distinct primes, primely splits a coarser ECS.…

Combinatorics · Mathematics 2015-06-03 Ofir Schnabel

We show that a variety $\mathcal V$ is congruence distributive if and only if there is some $h$ such that the inclusion (1) $\Theta \cap ( \sigma \circ \sigma ) \subseteq ( \Theta \cap \sigma ) \circ ( \Theta \cap \sigma ) \circ \dots $…

Rings and Algebras · Mathematics 2018-09-10 Paolo Lipparini

A split graph is a graph whose vertex set can be partitioned into a clique and an independent set. A split comparability graph is a split graph which is transitively orientable. In this work, we characterize split comparability graphs in…

Combinatorics · Mathematics 2025-04-29 Tithi Dwary , Khyodeno Mozhui , K. V. Krishna

Let $\sigma =\{\sigma_{i} | i\in I\}$ be some partition of the set of all primes $\Bbb{P}$ and let $G$ be a finite group. Then $G$ is said to be $\sigma $-full if $G$ has a Hall $\sigma _{i}$-subgroup for all $i$. A subgroup $A$ of $G$ is…

Group Theory · Mathematics 2017-09-20 Alexander N. Skiba

We give a necessary and sufficient condition in terms of group cohomology for two indecomposable module categories over a group-theoretical fusion category ${\mathcal C}$ to be equivalent. This concludes the classification of such module…

Quantum Algebra · Mathematics 2017-06-20 Sonia Natale

We prove that it is decidable if a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple permutations: every sufficiently long simple permutation contains…

Combinatorics · Mathematics 2007-05-23 Robert Brignall , Nik Ruskuc , Vince Vatter

Let $k$ be a field of characteristic $p > 0$. For $G$ an elementary abelian $p$-group, there exist collections of permutation module such that if $C^*$ is any exact bounded complex whose terms are sums of copies of modules from the…

Group Theory · Mathematics 2020-07-10 David J. Benson , Jon F. Carlson

Let $G$ be a free product of two groups with amalgamated subgroup, $\pi$ be either the set of all prime numbers or the one-element set \{$p$\} for some prime number $p$. Denote by $\Sigma$ the family of all cyclic subgroups of group $G$,…

Group Theory · Mathematics 2007-08-22 E. V. Sokolov

A structure $\mathcal{A}=\left(A;E_i\right)_{i\in n}$ where each $E_i$ is an equivalence relation on $A$ is called an $n$-grid if any two equivalence classes coming from distinct $E_i$'s intersect in a finite set. A function $\chi: A \to n$…

Logic · Mathematics 2014-09-19 Ramiro de la Vega