English
Related papers

Related papers: Strong G-schemes and strict homomorphisms

200 papers

A monoid $M$ generated by a set $S$ of symbols can be described as the set of equivalence classes of finite words in $S$ under some relations that specify when some contiguous sequence of symbols can be replaced by another. If $a,b\in S$, a…

Combinatorics · Mathematics 2011-01-26 Matthew J. Samuel

We fix a finitely presented group $Q$ and consider short exact sequences $1\to N\to G\to Q\to 1$ with $G$ finitely generated. The inclusion $N\to G$ induces a morphism of profinite completions $\hat N\to \hat G$. We prove that this is an…

Group Theory · Mathematics 2014-02-26 Martin R Bridson

For a finite non-empty set $X$, let $\mathfrak{P}(X)$ denote the set of all posets with carrier $X$, ordered by inclusion of their partial order relations. We investigate properties of posets $P \in \mathfrak{P}(X)$ for which no lower cover…

Combinatorics · Mathematics 2025-05-20 Frank a Campo

In section 1 we consider a 3-tuple $S=(|S|,\preccurlyeq,E)$ where $|S|$ is a finite set, $\preccurlyeq$ a partial ordering on $|S|,$ and $E$ a set of unordered pairs of distinct members of $|S|,$ and study, as a function of $n\geq 0,$ the…

Combinatorics · Mathematics 2018-06-12 George M. Bergman

Let $G$ be a discrete group. We prove that the category of $G$-posets admits a model structure that is Quillen equivalent to the standard model structure on $G$-spaces. As is already true nonequivariantly, the three classes of maps defining…

Algebraic Topology · Mathematics 2018-05-18 J. P. May , Marc Stephan , Inna Zakharevich

Given a finite group $G$, let $\pi(G)$ denote the set of all primes that divide the order of $G$. For a prime $r \in \pi(G)$, we define $r$-singular elements as those elements of $G$ whose order is divisible by $r$. Denote by $S_r(G)$ the…

Group Theory · Mathematics 2025-04-01 Rulin Shen , Deyu Yan

Let K \subset R^N be a convex body containing the origin. A measurable set G \subset R^N with positive Lebesgue measure is said to be uniformly K-dense if, for any fixed r > 0, the measure of G \cap (x + rK) is constant when x varies on the…

Metric Geometry · Mathematics 2013-08-06 Rolando Magnanini , Michele Marini

In this paper we study flat deformations of real subschemes of $\mathbb{P}^n$, hyperbolic with respect to a fixed linear subspace, i.e. admitting a finite surjective and real fibered linear projection. We show that the subset of the…

Algebraic Geometry · Mathematics 2022-10-04 Mario Kummer , Eli Shamovich

We study dismantlability in graphs. In order to compare this notion to similar operations in posets (partially ordered sets) or in simplicial complexes, we prove that a graph G dismants on a subgraph H if and only if H is a strong…

Combinatorics · Mathematics 2010-10-12 Etienne Fieux , Jacqueline Lacaze

For every group $G$, we introduce the set of hyperbolic structures on $G$, denoted $\mathcal{H}(G)$, which consists of equivalence classes of (possibly infinite) generating sets of $G$ such that the corresponding Cayley graph is hyperbolic;…

Group Theory · Mathematics 2019-08-21 Carolyn Abbott , Sahana Balasubramanya , Denis Osin

A closed convex conic subset $\mathcal{S}$ of the positive semidefinite (PSD) cone is rank-one generated (ROG) if all of its extreme rays are generated by rank-one matrices. The ROG property of $\mathcal{S}$ is closely related to the…

Optimization and Control · Mathematics 2021-05-27 C. J. Argue , Fatma Kılınç-Karzan , Alex L. Wang

Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising applications in database theory and machine learning, where…

Data Structures and Algorithms · Computer Science 2023-10-16 Jan Böker , Louis Härtel , Nina Runde , Tim Seppelt , Christoph Standke

In the framework of homological characterizations of relative hyperbolicity, Groves and Manning posed the question of whether a simply connected $2$-complex $X$ with a linear homological isoperimetric inequality, a bound on the length of…

Geometric Topology · Mathematics 2016-02-17 Eduardo Martinez-Pedroza

Given two algebraic groups $G$, $H$ over a field $k$, we investigate the representability of the functor of morphisms (of schemes) $\mathbf{Hom}(G,H)$ and the subfunctor of homomorphisms (of algebraic groups) $\mathbf{Hom}_{\rm gp}(G,H)$.…

Algebraic Geometry · Mathematics 2021-08-06 Michel Brion

Earlier an arbitrary poset $P$ was proved to be isomorphic to the collection of subsets of a space $M$ with two closures which are closed in the first closure and open in the other. As a space $M$ for this representation an algebraic dual…

General Topology · Mathematics 2007-05-23 R. Breslav , A. Stavrova , R. R. Zapatrin

We consider a generalized poset sorting problem (GPS), in which we are given a query graph $G = (V, E)$ and an unknown poset $\mathcal{P}(V, \prec)$ that is defined on the same vertex set $V$, and the goal is to make as few queries as…

Data Structures and Algorithms · Computer Science 2023-07-18 Shaofeng H. -C. Jiang , Wenqian Wang , Yubo Zhang , Yuhao Zhang

In this work, we study the well-posedness of certain sparse regularized linear regression problems, i.e., the existence, uniqueness and continuity of the solution map with respect to the data. We focus on regularization functions that are…

Statistics Theory · Mathematics 2024-09-06 Jasper Marijn Everink , Yiqiu Dong , Martin Skovgaard Andersen

A subfamily $\mathcal{G}\subseteq \mathcal{F}\subseteq 2^{[n]}$ of sets is a non-induced (weak) copy of a poset $P$ in $\mathcal{F}$ if there exists a bijection $i:P\rightarrow \mathcal{G}$ such that $p\le_P q$ implies $i(p)\subseteq i(q)$.…

Combinatorics · Mathematics 2022-07-27 Balázs Keszegh , Nathan Lemons , Ryan R. Martin , Dömötör Pálvölgyi , Balázs Patkós

The purpose of this paper is to study stable representations of partially ordered sets (posets) and compare it to the well known theory for quivers. In particular, we prove that every indecomposable representation of a poset of finite type…

Representation Theory · Mathematics 2019-02-27 Vyacheslav Futorny , Kostiantyn Iusenko

We study the problem of checking whether an existential sentence (that is, a first-order sentence in prefix form built using existential quantifiers and all Boolean connectives) is true in a finite partially ordered set (in short, a poset).…

Logic in Computer Science · Computer Science 2014-05-13 Simone Bova , Robert Ganian , Stefan Szeider