English
Related papers

Related papers: Strong G-schemes and strict homomorphisms

200 papers

A geometric graph \G is a simple graph drawn in the plane, on points in general position, with straight-line edges. We call \G a geometric realization of the underlying abstract graph G. A geometric homomorphism from \G to \H is a vertex…

Combinatorics · Mathematics 2013-06-25 Sally Cockburn

Let $R$ be a regular ring of dimension $d$ containing a field $K$ of characteristic zero. If $E$ is an $R$-module let $Ass^i E = \{ Q \in \ Ass E \mid \ height Q = i \}$. Let $P$ be a prime ideal in $R$ of height $g$. We show that if $R/P$…

Commutative Algebra · Mathematics 2024-10-25 Tony J. Puthenpurakal

We study two computational problems, parameterised by a fixed tree H. #HomsTo(H) is the problem of counting homomorphisms from an input graph G to H. #WHomsTo(H) is the problem of counting weighted homomorphisms to H, given an input graph G…

Computational Complexity · Computer Science 2014-06-16 Leslie Ann Goldberg , Mark Jerrum

Let $G$ and $H$ be quasi-isometric finitely generated groups and let $P\leq G$; is there a subgroup $Q$ (or a collection of subgroups) of $H$ whose left cosets coarsely reflect the geometry of the left cosets of $P$ in $G$? We explore…

Group Theory · Mathematics 2022-12-21 Eduardo Martínez-Pedroza , Luis Jorge Sánchez Saldaña

Assume $G$ is a solvable group whose elementary abelian sections are all finite. Suppose, further, that $p$ is a prime such that $G$ fails to contain any subgroups isomorphic to $C_{p^\infty}$. We show that if $G$ is nilpotent, then the…

Group Theory · Mathematics 2013-03-21 Karl Lorensen

The poset of copies of a relational structure ${\mathbb X}$ is the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X})=\{ Y\subset X: {\mathbb Y} \cong {\mathbb X}\}$. Investigating the…

Logic · Mathematics 2024-06-07 Miloš S. Kurilić

We study two new parameters for finite posets motivated by the problem of efficiently determining the set of successors of a given element. A plane map of a poset $P=(X,\leq)$ is an injective mapping of $X$ into the Cartesian plane…

Combinatorics · Mathematics 2026-05-21 Stefan Felsner , Jędrzej Hodor , Giacomo Ortali , Alexander Wolff

Given finite posets $P$ and $Q$, we consider a specific ideal $L(P,Q)$, whose minimal monomial generators correspond to order-preserving maps $\phi:P\rightarrow Q$. We study algebraic invariants of those ideals. In particular, sharp lower…

Commutative Algebra · Mathematics 2016-04-26 Martina Juhnke-Kubitzke , Lukas Katthän , Sara Saeedi Madani

In this paper, we introduce the notion of $\mathcal{M}$-convergence and $\mathcal{MN}$-convergence structures in posets, which, in some sense, generalise the well-known Scott-convergence and order-convergence structures. As results, we give…

General Topology · Mathematics 2018-03-20 Hadrian Andradi , Weng Kin Ho

Following G. Gr\"atzer and E. Knapp (2007), a slim semimodular lattice, SPS lattice for short, is a finite planar semimodular lattice having no $M_3$ as a sublattice. An SPS lattice is a slim rectangular lattice if it has exactly two doubly…

Rings and Algebras · Mathematics 2023-07-17 Gábor Czédli

The poset of copies of a relational structure ${\mathbb X}$ is the partial order ${\mathbb P} ({\mathbb X} ) := \langle \{ Y \subset X: {\mathbb Y} \cong {\mathbb X}\}, \subset \rangle$ and each similarity of such posets (e.g. isomorphism,…

Logic · Mathematics 2023-10-17 Miloš S. Kurilić , Stevo Todorčević

Let $P$ be a finite poset. We will show that for any reasonable $P$-persistent object $X$ in the category of finite topological spaces, there is a $P-$ weighted graph, whose clique complex has the same $P$-persistent homology as $X$.

Algebraic Topology · Mathematics 2015-02-18 Francesco Vaccarino , Alice Patania , Giovanni Petri

Let $H$ be an acylindrically hyperbolic group without nontrivial finite normal subgroups. We show that any finite system $S$ of equations with constants from $H$ is equivalent to a single equation. We also show that the algebraic set…

Group Theory · Mathematics 2019-03-27 Oleg Bogopolski

We propose a functorial framework for persistent homology based on finite topological spaces and their associated posets. Starting from a finite metric space, we associate a filtration of finite topologies whose structure maps are…

Algebraic Topology · Mathematics 2026-02-24 Selçuk Kayacan

The dimension of a partially ordered set $P$ (poset for short) is the least positive integer $d$ such that $P$ is isomorphic to a subposet of $\mathbb{R}^d$ with the natural product order. Dimension is arguably the most widely studied…

Combinatorics · Mathematics 2025-12-19 Heather Smith Blake , Jędrzej Hodor , Piotr Micek , Michał T. Seweryn , William T. Trotter

One of possible cryptomorphic definitions of a partially ordered set (= a poset) $P$ on a non-empty finite basic set $N$ is in terms of the set ${\cal L}(P)$ of all its linear extensions, that is, in terms of the set of total orders of $N$…

Combinatorics · Mathematics 2025-11-25 Milan Studený , Václav Kratochvíl

For a Lie group $G$ and a closed Lie subgroup $H\subset G$, it is well known that the coset space $G/H$ can be equipped with the structure of a manifold homogeneous under $G$ and that any $G$-homogeneous manifold is isomorphic to one of…

Differential Geometry · Mathematics 2008-11-18 E. G. Vishnyakova

In this paper we initiate a study of the topological group $PPQI(G,H)$ of pattern-preserving quasi-isometries for $G$ a hyperbolic Poincare duality group and $H$ an infinite quasiconvex subgroup of infinite index in $G$. Suppose $\partial…

Geometric Topology · Mathematics 2012-07-12 Mahan Mj

The aim of the present paper is to extend the concept of a congruence from lattices to posets. We use an approach different from that used by the first author and V. Sn\'a\v{s}el. By using our definition we show that congruence classes are…

Combinatorics · Mathematics 2025-03-25 Ivan Chajda , Helmut Länger

In this paper we are interested in the fine-grained complexity of deciding whether there is a homomorphism from an input graph $G$ to a fixed graph $H$ (the $H$-Coloring problem). The starting point is that these problems can be viewed as…

Computational Complexity · Computer Science 2024-04-16 Ambroise Baril , Miguel Couceiro , Victor Lagerkvist