English
Related papers

Related papers: Characterization of complementing pairs of $({\mat…

200 papers

Let $D \subseteq A$ be a quasi-Cartan pair of algebras. Then there exists a unique discrete groupoid twist $\Sigma \to G$ whose twisted Steinberg algebra is isomorphic to $A$ in a way that preserves $D$. In this paper, we show there is a…

Rings and Algebras · Mathematics 2024-11-26 Jonathan H. Brown , Lisa Orloff Clark , Adam H. Fuller

The notion of a subtractive category, recently introduced by the author, is a ``categorical version'' of the notion of a (pointed) subtractive variety of universal algebras, due to A. Ursini. We show that a subtractive variety $\C$, whose…

Category Theory · Mathematics 2007-05-23 Zurab Janelidze

Maxmin trees are labeled trees with the property that each vertex is either a local maximum or a local minimum. Such trees were originally introduced by Postnikov, who gave a formula to count them and different combinatorial interpretations…

Combinatorics · Mathematics 2019-02-06 William Dugan , Sam Glennon , Paul E. Gunnells , Einar Steingrimsson

A balanced pair in an ordered set $P=(V,\leq)$ is a pair $(x,y)$ of elements of $V$ such that the proportion of linear extensions of $P$ that put $x$ before $y$ is in the real interval $[1/3, 2/3]$. We define the notion of a good pair and…

Combinatorics · Mathematics 2017-06-20 Imed Zaguia

The notion of a congruence pair for principal MS-algebras, simpler than the one given by Beazer for $K_2$-algebras \cite{6}, is introduced. It is proved that the congruences of the principal MS-algebras $L$ correspond to the MS-congruence…

Logic · Mathematics 2019-12-30 Abd El-Mohsen Badawy , Miroslav Haviar , Miroslav Ploščica

A pairing of a graph $G$ is a perfect matching of the complete graph having the same vertex set as $G$. If every pairing of $G$ can be extended to a Hamiltonian cycle of the underlying complete graph using only edges from $G$, then $G$ has…

Combinatorics · Mathematics 2022-03-22 John Baptist Gauci , Jean Paul Zerafa

In the theory of zero-dimensional systems and their relation to $C^*$-algebras, Poon (1990) introduced a class of closed sets. We call the closed sets quasi-sections. Medynets (2006) introduced basic sets that are part of quasi-sections in…

Dynamical Systems · Mathematics 2022-08-24 Takashi Shimomura

We say a completely positive contractive map between two C*-algebras has order zero, if it sends orthogonal elements to orthogonal elements. We prove a structure theorem for such maps. As a consequence, order zero maps are in one-to-one…

Operator Algebras · Mathematics 2009-03-20 Wilhelm Winter , Joachim Zacharias

We prove a conjecture due to Baumgaertel and Lledo according to which for every compact group G one has Z(G)^ \cong C(G), where the `chain group' C(G) is the free abelian group (written multiplicatively) generated by the set G^ of…

Group Theory · Mathematics 2007-05-23 Michael Mueger

We discuss several questions concerning sum-free sets in groups, raised by Erd\H{o}s in his survey "Extremal problems in number theory" (Proceedings of the Symp. Pure Math. VIII AMS) published in 1965. Among other things, we give a…

Combinatorics · Mathematics 2016-03-17 Terence Tao , Van Vu

A classical theorem due to Mycielski states that an equivalence relation $E$ having the Baire property and meager equivalence classes must have a perfect set of pairwise inequivalent elements. We consider equivalence relations with…

Logic · Mathematics 2016-05-31 Ohad Drucker

We characterize when the elementary diagram of a mutually algebraic structure has a model complete theory, and give an explicit description of a set of existential formulas to which every formula is equivalent. This characterization yields…

Logic · Mathematics 2016-02-10 Michael C. Laskowski

Let $X$ be an $n$-element set. A set-pair system $\mbox{$\cal P$}=\{(A_i,B_i)\}_{1\leq i\leq m}$ is a collection of pairs of disjoint subsets of $X$. It is called skew Bollob\'as system if $A_i\cap B_j\neq \emptyset$ for all $1\leq i<j \leq…

Combinatorics · Mathematics 2023-07-28 Gábor Hegedüs , Péter Frankl

Using a ``3 by 3 matrix trick'' we previously showed that multiplication in a C*-algebra A, an algebraic structure, is determined by the geometry of the C*-algebra of the 3 by 3 matrices with entries from A. As an application of this…

Operator Algebras · Mathematics 2007-05-23 Robert A. Cohen , Martin E. Walter

We prove the Arad-Herzog conjecture for various families of finite simple groups- if A and B are nontrivial conjugacy classes, then AB is not a conjugacy class. We also prove that if G is a finite simple group of Lie type and A and B are…

Group Theory · Mathematics 2012-02-28 Robert M. Guralnick , Gunter Malle , Pham Huu Tiep

We prove a connexity theorem for abelian varieties in characteristic $0$: if $X$ is an abelian variety and $V\rightarrow X$ and $W\rightarrow X$ two morphisms, then, under certain hypotheses, the fiber product of $V$ and $W$ over $X$ is…

alg-geom · Mathematics 2008-02-03 Olivier Debarre

In 2013, Lee, Li, and Zelevinsky introduced combinatorial objects called compatible pairs to construct the greedy bases for rank-2 cluster algebras, consisting of indecomposable positive elements including the cluster monomials.…

Combinatorics · Mathematics 2024-09-24 Amanda Burcroff , Kyungyong Lee , Lang Mou

In this paper, we consider associative algebras equipped with derivations. A pair consisting of an associative algebra and a distinguished derivation is called an AssDer pair. We study central extensions and formal one-parameter…

Rings and Algebras · Mathematics 2025-10-14 Apurba Das , Ashis Mandal

Let $G$ be a finite additive abelian group with exponent $n$ and $S=g_{1}\cdots g_{t}$ be a sequence of elements in $G$. For any element $g$ of $G$ and $A\subseteq\{1,2,\ldots,n-1\}$, let $N_{A,g}(S)$ denote the number of subsequences…

Number Theory · Mathematics 2019-01-04 Abílio Lemos , Allan O. Moura , Anderson T. Silva , B. K. Moriya

For a given graph consider a pair of disjoint matchings the union of which contains as many edges as possible. Furthermore, consider the relation of the cardinalities of a maximum matching and the largest matching in those pairs. It is…

Discrete Mathematics · Computer Science 2009-03-03 A. V. Tserunyan