English
Related papers

Related papers: Embeddings into the generic poset

200 papers

We introduce posets with interfaces (iposets) and generalise their standard serial composition to a new gluing composition. In the partial order semantics of concurrency, interfaces and gluing allow modelling events that extend in time and…

Formal Languages and Automata Theory · Computer Science 2022-11-07 Uli Fahrenberg , Christian Johansen , Georg Struth , Krzysztof Ziemiański

We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental…

Combinatorics · Mathematics 2009-10-30 Reinhard Diestel , Philipp Sprüssel

We consider frames in a finite-dimensional Hilbert space where frames are exactly the spanning sets of the vector space. A factor poset of a frame is defined to be a collection of subsets of $I$, the index set of our vectors, ordered by…

We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…

Metric Geometry · Mathematics 2025-12-23 Paolo Bonicatto , Panu Lahti , Enrico Pasqualetto

We characterize the fixed sets of automorphisms of an arbitrary countable, arithmetically saturated structure.

Logic · Mathematics 2026-05-21 James Schmerl

We give conditions for a locally finite poset $P$ to have the property that for any functions $f:P\to {\bf C}$ and $g:P\to {\bf C}$ not identically zero and linked by the M\"obius inversion formula, the support of at least one of $f$ and…

Combinatorics · Mathematics 2026-03-03 Marcel K. Goh

Let $k$ be a field of characteristic $p>0$, which has infinitely many discrete valuations. We show that every finite embedding problem for $\Gal(k)$ with finitely many prescribed local conditions, whose kernel is a $p$-group, is properly…

Number Theory · Mathematics 2011-02-22 Nguyen Duy Tan

We obtain some general restrictions on the continuous endomorphisms of a profinite group G under the assumption that G has only finitely many open subgroups of each index (an assumption which automatically holds, for instance, if G is…

Group Theory · Mathematics 2011-12-19 Colin D. Reid

The main result: for every sequence $\{\omega_m\}_{m=1}^\infty$ of positive numbers ($\omega_m>0)$ there exists an isometric embedding $F:[0,1]\to L_1[0,1]$ which is nowhere differentiable, but for each $t\in [0,1]$ the image $F_t$ is…

Functional Analysis · Mathematics 2018-11-13 Florin Catrina , Mikhail I. Ostrovskii

The random graph is an infinite graph with the universal property that any embedding of $G-v$ extends to an embedding of $G$, for any finite graph. In this paper we show that this graph embeds in the curve graph of a surface $\Sigma$ if and…

Geometric Topology · Mathematics 2016-12-20 Edgar A. Bering , Jonah Gaster

For a given poset, we consider its representations by systems of subspaces of a unitary space ordered by inclusion. We classify such systems for all posets for which an explicit classification is possible.

Given a countable model of set theory, we study the structure of its generic multiverse, the collection of its forcing extensions and ground models, ordered by inclusion. Mostowski showed that any finite poset embeds into the generic…

Let $G$ be an acylic directed graph. For each vertex $g \in G$, we define an involution on the independent sets of $G$. We call these involutions flips, and use them to define a new partial order on independent sets of $G$. Trim lattices…

Combinatorics · Mathematics 2019-04-01 Hugh Thomas , Nathan Williams

We consider a category of all finite partial orderings with quotient maps as arrows and construct a Fra\"iss\'e sequence in this category. Then we use commonly known relations between partial orders and lattices to construct a sequence of…

Combinatorics · Mathematics 2022-01-26 Szymon Głcab , Michał Pawlikowski

Let $G$ be a connected reductive affine algebraic group defined over $\mathbb C$ and $\mathfrak g$ its Lie algebra. We study the monodromy map from the space of $\mathfrak g$-differential systems on a compact connected Riemann surface…

Algebraic Geometry · Mathematics 2022-03-11 Indranil Biswas , Sorin Dumitrescu

We study the embedding property in the category of sorted profinite groups. We introduce a notion of the sorted embedding property (SEP), analogous to the embedding property for profinite groups. We show that any sorted profinite group has…

Logic · Mathematics 2023-10-10 Junguk Lee

This is the first in a sequence of three papers in which we prove the following generalization of Thomassen's 5-choosability theorem: Let $G$ be a finite graph embedded on a surface of genus $g$. Then $G$ can be $L$-colored, where $L$ is a…

Combinatorics · Mathematics 2024-03-22 Joshua Nevin

A complete embedding is a symplectic embedding $\iota:Y\to M$ of a geometrically bounded symplectic manifold $Y$ into another geometrically bounded symplectic manifold $M$ of the same dimension. When $Y$ satisfies an additional finiteness…

Symplectic Geometry · Mathematics 2023-01-25 Yoel Groman , Umut Varolgunes

Given a symmetric monoidal category $C$ with product $\sqcup$, where the neutral element for the product is an initial object, we consider the poset of $\sqcup$-complemented subobjects of a given object $X$. When this poset has finite…

Combinatorics · Mathematics 2025-07-30 Kevin Ivan Piterman , Volkmar Welker

Let $\mathcal{A}$ be a set of positive numbers. A graph $G$ is called an $\mathcal{A}$-embeddable graph in $\mathbb{R}^d$ if the vertices of $G$ can be positioned in $\mathbb{R}^d$ so that the distance between endpoints of any edge is an…

Computational Complexity · Computer Science 2017-10-17 Mikhail Tikhomirov
‹ Prev 1 3 4 5 6 7 10 Next ›