English
Related papers

Related papers: The Ho-Zhao Problem

200 papers

In this paper, we justify and make precise an elementary approach that establishes the existence of (co)limits in $\mathbf{Cat}$. This approach, while conceptually evident, has not been made fully explicit or systematically described in the…

Category Theory · Mathematics 2026-04-16 Varinderjit Mann

For a stationary set S subseteq omega_1 and a ladder system C over S, a new type of gaps called C-Hausdorff is introduced and investigated. We describe a forcing model of ZFC in which, for some stationary set S, for every ladder C over S,…

Logic · Mathematics 2007-05-23 Uri Abraham , Saharon Shelah

A convenient bicategory of topological stacks is constructed which is both complete and Cartesian closed. This bicategory, called the bicategory of compactly generated stacks, is the analogue of classical topological stacks, but for a…

Algebraic Topology · Mathematics 2016-10-18 David Carchedi

Let $\Gamma$ be a finitely generated cocompact lattice of a totally disconnected locally compact group $G$, and $C$ a dense subgroup of $G$ that contains and commensurates $\Gamma$. We study the problem of describing all finitely generated…

Group Theory · Mathematics 2026-04-08 Adrien Le Boudec , Colin Reid

We show that the regular separability problem of VASS reachability languages is decidable and $\mathbf{F}_{\omega}$-complete. At the heart of our decision procedure are doubly-marked graph transition sequences, a new proof object that…

Formal Languages and Automata Theory · Computer Science 2025-08-12 Eren Keskin , Roland Meyer

Let $G$ be a connected semisimple real algebraic group. For any Zariski dense Anosov subgroup $\Gamma <G$, we show that a $\Gamma$-conformal measure is supported on the limit set of $\Gamma$ if and only if its "dimension" is…

Dynamical Systems · Mathematics 2025-06-23 Minju Lee , Hee Oh

A subset $C$ of the vertex set of a graph $\Gamma$ is called a perfect code in $\Gamma$ if every vertex of $\Gamma$ is at distance no more than 1 to exactly one vertex of $C$. A subgroup $H$ of a group $G$ is called a subgroup perfect code…

Combinatorics · Mathematics 2025-07-22 Huye chen , Binbin Li , Jingjian Li , Hao Yu

Harding showed that the direct product decompositions of many different types of structures, such as sets, groups, vector spaces, topological spaces, and relational structures, naturally form orthomodular posets. When applied to the direct…

Combinatorics · Mathematics 2013-08-26 Tim Hannan , John Harding

The first part of this article is devoted to characterizing the cocycles $\alpha$ of a finite group $G$ that give rise to faithful projective representations of $G$. We prove that a $p$-group $G$ admits a faithful irreducible projective…

Representation Theory · Mathematics 2026-05-27 Sumana Hatui , Poonam Nayak

Homotopical localizations with respect to (possibly proper) classes of maps are known to exist assuming the validity of a large-cardinal axiom from set theory called Vop\v{e}nka's principle. In this article, we prove that each of the…

Algebraic Topology · Mathematics 2024-10-29 Carles Casacuberta , Javier J. Gutiérrez

Let $G$ be a finite group and $p$ be a prime. We denote by $C_p(G)$ the poset of all cosets of $p$-subgroups of $G$. We characterize the homotopy type of the geometric realization $|\Delta C_p(G)|$ for $p$-closed groups $G$, which is…

Group Theory · Mathematics 2025-03-11 Huilong Gu , Hangyang Meng , Xiuyun Guo

We provide a new large class of countable icc groups $\mathcal A$ for which the product rigidity result from [CdSS15] holds: if $\Gamma_1,\dots,\Gamma_n\in\mathcal A$ and $\Lambda$ is any group such that…

Operator Algebras · Mathematics 2021-09-22 Daniel Drimbe

In a previous paper, the author (together with Matthew Emerton) proved that the completed cohomology groups of SL_N(Z) are stable in fixed degree as N goes to infinity (Z may be replaced by the ring O_F of integers of any number field). In…

Algebraic Topology · Mathematics 2015-02-03 Frank Calegari

Let $T$ be a complete, model-complete, geometric dp-minimal $\mathcal{L}$-theory of topological fields of characteristic $0$ and let $T(\partial)$ be the theory of expansions of models of $T$ by a derivation $\partial$. We assume that…

Logic · Mathematics 2025-05-13 Françoise Point

We show that the homotopy category of a combinatorial stable model category $\ck$ is well generated. It means that each object $K$ of $\Ho(\ck)$ is an iterated weak colimit of $\lambda$-compact objects for some cardinal $\lambda$. A natural…

Category Theory · Mathematics 2009-12-03 J. Rosicky

Let A be a cogroup in the category of connected graded algebras over a commutative ring R. Let nu denote the inverse of A and chi the antipode of the underlying Hopf algebra of A. We clarify the differences and similarities of nu and chi,…

Rings and Algebras · Mathematics 2013-04-01 Hiroshi Kihara

Let $X$ be a negatively curved symmetric space and $\Gamma$ a non-cocompact lattice in $\rm{Isom}(X)$. We show that small, parabolic-preserving deformations of $\Gamma$ into the isometry group of any negatively curved symmetric space…

Geometric Topology · Mathematics 2019-02-11 Samuel A. Ballas , Julien Paupert , Pierre Will

In this paper we establish a faithfulness result, in a homotopical sense, between a subcategory of the model category of augmented differential graded commutative algebras CDGA and a subcategory of the model category of augmented…

Algebraic Topology · Mathematics 2014-01-29 Ilias Amrani

In the present article, we describe constructions of model structures on general bicomplete categories. We are motivated by the following question: given a category $\mathcal{C}$ with a subcategory $w\mathcal{C}$ closed under retracts, when…

Algebraic Topology · Mathematics 2014-09-29 Jean-Marie Droz , Inna Zakharevich

A dichotomy theorem for counting problems due to Creignou and Hermann states that or any nite set S of logical relations, the counting problem #SAT(S) is either in FP, or #P-complete. In the present paper we show a dichotomy theorem for…

Computational Complexity · Computer Science 2009-12-15 Irénée Briquel , Pascal Koiran