English
Related papers

Related papers: Trivial Isomorphisms between Reduced Products

200 papers

We generalize the graphical small cancellation theory of Gromov to a graphical small cancellation theory over the free product. We extend Gromov's small cancellation theorem to the free product. We explain and generalize Rips-Segev's…

Group Theory · Mathematics 2015-06-08 Markus Steenbock

A $(d-1)$-dimensional simplicial complex is called balanced if its underlying graph admits a proper $d$-coloring. We show that many well-known face enumeration results have natural balanced analogs (or at least conjectural analogs).…

Combinatorics · Mathematics 2016-02-10 Steven Klee , Isabella Novik

Haviv ({\em European Journal of Combinatorics}, 2019) has recently proved that some topological lower bounds on the chromatic number of graphs are also lower bounds on their orthogonality dimension over $\mathbb{R}$. We show that this holds…

Combinatorics · Mathematics 2019-10-14 Meysam Alishahi , Frédéric Meunier

The operation of switching a graph $\Gamma$ with respect to a subset $X$ of the vertex set interchanges edges and non-edges between $X$ and its complement, leaving the rest of the graph unchanged. This is an equivalence relation on the set…

Combinatorics · Mathematics 2015-02-19 Peter J. Cameron , Pablo Spiga

There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…

Combinatorics · Mathematics 2012-04-06 Eric Babson , Matthias Beck

Let C be a separable unital C*-algebra, not isomorphic to the complex numbers, equipped with a faithful tracial state. Let A be a unital direct limit of one dimensional NCCW complexes, also equipped with a faithful tracial state. Suppose…

Operator Algebras · Mathematics 2026-02-12 Ilan Hirshberg , N. Christopher Phillips

In this paper, we prove that the group $\mathrm{Aut}_\mathbb{Q}(X)$ of numerically trivial automorphisms are uniformly bounded for smooth projective threefolds $X$ of general type which either satisfy $q(X)\geq 3$ or have a Gorenstein…

Algebraic Geometry · Mathematics 2022-06-09 Zhi Jiang , Wenfei Liu , Hang Zhao

We rewrite classical topological definitions using the category-theoretic notation of arrows and are led to concise reformulations in terms of simplicial categories and orthogonality of morphisms, which we hope might be of use in the…

Category Theory · Mathematics 2018-07-19 Misha Gavrilovich , Konstantin Pimenov

We give new characterizations to ensure that a free product of groups with amalgamation has a simple reduced group C*-algebra, and provide a concrete example of an amalgam with trivial kernel, such that its reduced group C*-algebra has a…

Operator Algebras · Mathematics 2017-12-01 Nikolay A. Ivanov , Tron Omland

We show that unital simple C*-algebras with tracial topological rank zero which are locally approximated by subhomogeneous C^-algebras can be classified by their ordered $K$-theory. We apply this classification result to show that certain…

Operator Algebras · Mathematics 2007-05-23 Huaxin Lin

We show that the automorphism groups of countably categorical linear orders are extremely amenable. Using methods of Kechris, Pestov, and Todorcevic, we use this fact to derive a structural Ramsey theorem for certain families of finite…

Logic · Mathematics 2014-02-17 François G. Dorais , Steven Gubkin , Daniel McDonald , Manuel Rivera

A reduction $\varphi$ of an ordered group $(G,P)$ to another ordered group is an order homomorphism which maps each interval $[1,p]$ bijectively onto $[1, \varphi(p)]$. We show that if $(G,P)$ is weakly quasi-lattice ordered and reduces to…

Group Theory · Mathematics 2021-03-17 Robert Huben

In this paper we enumerate the necessary and sufficient conditions for the weak modular product of two simple graphs to be perfect. The weak modular product differs from the direct product by also encoding non-adjacencies of the factor…

Combinatorics · Mathematics 2018-09-27 Danial Dervovic

It is well-known that the size of propositional classical proofs can be huge. Proof theoretical studies discovered exponential gaps between normal or cut free proofs and their respective non-normal proofs. The aim of this work is to study…

Logic in Computer Science · Computer Science 2014-04-02 Marcela Quispe-Cruz , Edward Hermann Haeusler , Lew Gordeev

We study conditions on automorphisms of Boolean algebras of the form $P(\lambda)/I_\kappa$ (where $\lambda$ is an uncountable cardinal and $I_\kappa$ is the ideal of sets of cardinality less than $\kappa$) which allow one to conclude that a…

Logic · Mathematics 2015-08-31 Paul Larson , Paul McKenney

It is shown how to model any automorphism of a totally disconnected, locally compact group by a symbolic dynamical system. The model is an inverse limit of a product of a full-shift, on a finite number of symbols, with one of two types of…

Dynamical Systems · Mathematics 2024-03-26 Bruce P. Kitchens

The \emph{zero forcing number} $Z(G)$ of a graph $G$ is the minimum cardinality of a set $S$ of black vertices (whereas vertices in $V(G)\setminusS$ are colored white) such that $V(G)$ is turned black after finitely many applications of…

Combinatorics · Mathematics 2012-08-20 Cong X. Kang , Eunjeong Yi

It is shown that the coloured isomorphism class of a unital, simple, $\mathcal{Z}$-stable, separable amenable C$^*$-algebra satisfying the Universal Coefficient Theorem (UCT) is determined by its tracial simplex.

Operator Algebras · Mathematics 2022-04-14 Jeffrey Im , George A. Elliott

We show that the generic automorphism is axiomatisable in the green field of Poizat (once Morleyised) as well as in the bad fields which are obtained by collapsing this green field to finite Morley rank. As a corollary, we obtain "bad…

Logic · Mathematics 2012-01-04 Martin Hils

We prove that asymptotically almost all vectorial functions over finite fields have trivial extended-affine stabilizers. As a consequence, the number of EA-equivalence classes is asymptotically equal to the naive estimate, namely the total…

Combinatorics · Mathematics 2026-05-25 Keita Ishizuka
‹ Prev 1 3 4 5 6 7 10 Next ›