English
Related papers

Related papers: The Relation between Composability and Splittabili…

200 papers

We characterize the group property of being with infinite conjugacy classes (or icc, i.e. in which all conjugacy classes beside 1 are infinite) for split extensions of groups.

Group Theory · Mathematics 2007-05-23 Jean-Philippe Preaux

The following theorem is proved: Let $G$ be a finite group and $\pi_e(G)$ be the set of element orders in $G$. If $\pi_e(G) \cap \{2\}=\emptyset$; or $\pi_e(G) \cap \{3, 4\}=\emptyset$; or $\pi_e(G) \cap \{3,5\}=\emptyset$, then $G$ is…

Group Theory · Mathematics 2017-04-06 Wujie Shi

Let $G$ be a finite group. Let $\sigma =\{\sigma_{i} | i\in I\}$ be a partition of the set of all primes $\Bbb{P}$ and $n$ an integer. We write $\sigma (n) =\{\sigma_{i} |\sigma_{i}\cap \pi (n)\ne \emptyset \}$, $\sigma (G) =\sigma (|G|)$.…

Group Theory · Mathematics 2017-01-19 Wenbin Guo , Chi Zhang , Alexander N. Skiba , Darya A. Sinitsa

The main aim of the article is to show, in the absence of the Axiom of Choice, relationships between the following, independent of $\mathbf{ZF}$, statements: "Every countable product of compact metrizable spaces is separable (respectively,…

General Topology · Mathematics 2021-09-03 Kyriakos Keremedis , Eleftherios Tachtsis , Eliza Wajch

In this paper, we investigate the conditions for the Mal'cev-Neumann series ring {\Lambda} = R((G;{\sigma};{\tau})) to be left fusible and an SA-ring. Also, we show that: if G is a quasitotally ordered group and U a {\Sigma}-compatible…

Rings and Algebras · Mathematics 2024-04-30 Mohammad. H. Fahmy , Refaat. M. Salem , Shaimaa. Sh. Shehata

We consider first-order logics of sequences ordered by the subsequence ordering, aka sequence embedding. We show that the \Sigma_2 theory is undecidable, answering a question left open by Kuske. Regarding fragments with a bounded number of…

Logic in Computer Science · Computer Science 2016-07-07 Prateek Karandikar , Philippe Schnoebelen

The homomorphic image of a congruence is always a tolerance (relation) but, within a given variety, a tolerance is not necessarily obtained this way. By a Maltsev-like condition, we characterize varieties whose tolerances are homomorphic…

Rings and Algebras · Mathematics 2024-11-01 Gabor Czedli , Emil W. Kiss

Let N be a normal subgroup of a finite group G and consider the set cd(G|N) of degrees of irreducible characters of G whose kernels do not contain N. A number of theorems are proved relating the set cd(G|N) to the structure of N. For…

Group Theory · Mathematics 2009-09-25 I. M. Isaacs , Greg Knutson

We prove that indecomposable $\Sigma$-pure-injective modules for a string algebra are string or band modules. The key step in our proof is a splitting result for infinite-dimensional linear relations.

Rings and Algebras · Mathematics 2017-05-30 Raphael Bennett-Tennenhaus , William Crawley-Boevey

A quantum system consisting of two subsystems is separable if its density matrix can be written as $\rho=\sum w_K \rho_K'\otimes \rho_K''$, where $\rho_K'$ and $\rho_K''$ are density matrices for the two subsytems, and the positive weights…

Quantum Physics · Physics 2007-05-23 Asher Peres

H. Lenstra has pointed out that a cubic polynomial of the form (x-a)(x-b)(x-c) + r(x-d)(x-e), where {a,b,c,d,e} is some permutation of {0,1,2,3,4}, is irreducible modulo 5 because every possible linear factor divides one summand but not the…

Number Theory · Mathematics 2022-09-22 Evan M. O'Dorney

A semigroup $S$ is called a permutable semigroup if $\alpha \circ \beta =\beta \circ \alpha$ is satified for all congruences $\alpha$ and $\beta$ of $S$. A semigroup is called a Putcha semigroup if it is a semilattice of archimedean…

Group Theory · Mathematics 2014-02-21 Attila Deák , Attila Nagy

There are characteristic classes that are the obstructions to the vanishing of the differentials in the Lyndon-Hochischild-Serre spectral sequence of an extension of an integral lattice L by a group G. These characteristic classes exist in…

Algebraic Topology · Mathematics 2009-06-18 Nansen Petrosyan

In tri-partite systems, there are three basic biseparability, $A$-$BC$, $B$-$CA$ and $C$-$AB$ biseparability according to bipartitions of local systems. We begin with three convex sets consisting of these basic biseparable states in the…

Quantum Physics · Physics 2022-04-13 Kil-Chan Ha , Kyung Hoon Han , Seung-Hyeok Kye

Let $k$ be an algebraically closed field of prime characteristic $p$, and let $P$ be a $p$-subgroup of a finite group $G$. We give sufficient conditions for the $kG$-Scott module $\mathrm{Sc}(G,P)$ with vertex $P$ to remain indcomposable…

Representation Theory · Mathematics 2015-11-30 Radha Kessar , Shigeo Koshitani , Markus Linckelmann

In this paper, we study the structures of finite groups using some arithmetic conditions on the sizes of real conjugacy classes. We prove that a finite group is solvable if the prime graph on the real class sizes of the group is…

Group Theory · Mathematics 2018-03-06 Hung P. Tong-Viet

We investigate separability and entanglement of mixed states in ${\cal C}^2\otimes{\cal C}^2\otimes{\cal C}^N$ three party quantum systems. We show that all states with positive partial transposes that have rank $\le N$ are separable. For…

Quantum Physics · Physics 2009-11-07 S. Karnas , M. Lewenstein

We provide necessary and sufficient conditions for separability of mixed states. As a result we obtain a simple criterion of separability for $2\times2$ and $2\times3$ systems. Here, the positivity of the partial transposition of a state is…

Quantum Physics · Physics 2009-10-30 Michal Horodecki , Pawel Horodecki , Ryszard Horodecki

We show that the necessary conditions for the existence of 4-GDDs of type g^u m^1 are sufficient for g congruent to 0 (mod h), h = 39, 51, 57, 69, 87, 93, and for g = 13, 17, 19, 23, 25, 29, 31 and 35. More generally, we show that for all g…

Combinatorics · Mathematics 2018-06-21 Anthony D. Forbes

We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…

Logic in Computer Science · Computer Science 2007-05-23 Sabine Glesner , Karl Stroetmann
‹ Prev 1 8 9 10 Next ›