English
Related papers

Related papers: Embeddings into the generic poset

200 papers

Let $V$ be a left vector space over a division ring and let ${\mathcal P}(V)$ be the associated projective space. We describe all finite subsets $X\subset V$ such that every permutation on $X$ can be extended to a linear automorphism of $V$…

Group Theory · Mathematics 2012-06-28 Mark Pankov

For any finite poset we define a generating polynomial counting upsets, downsets, and their intersection. We investigate the behaviour of this polynomial with respect to poset operations, show that it distinguishes series-parallel posets,…

Combinatorics · Mathematics 2025-11-20 Ian George , Karen Yeats

Every clone of functions comes naturally equipped with a topology---the topology of pointwise convergence. A clone $\mathfrak{C}$ is said to have automatic homeomorphicity with respect to a class $\mathcal{C}$ of clones, if every…

Logic · Mathematics 2017-04-04 Christian Pech , Maja Pech

In the setting of step 2 sub-Finsler Carnot groups with strictly convex norms, we prove that all infinite geodesics are lines. It follows that for any other homogeneous distance, all geodesics are lines exactly when the induced norm on the…

Metric Geometry · Mathematics 2019-11-20 Eero Hakavuori

For each $n\geq 2$, we show that the class of all finite $n$-dimensional partial orders, when expanded with $n$ linear orders which realize the partial order, forms a Fra\"iss\'e class and identify its Fra\"iss\'e limit…

Combinatorics · Mathematics 2025-01-16 Iian B. Smythe , Mithuna Threz , Max Wiebe

Various characterizations are offered of injectivity of the canonical fundamental group homomorphism for a certain class of inverse limit spaces. One application characterizes the existence of a kind of generalized universal cover.

Algebraic Topology · Mathematics 2007-05-23 Paul Fabel

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

A topology is defined on the mapping class group of a compact connected orientable surface. It is shown that a notion of "genericity" on subsets of the mapping class group arises from this definition. Many plausible results follow from this…

Geometric Topology · Mathematics 2025-08-06 Ingrid Irmer

We show that any finite set S in a characteristic zero integral domain can be mapped to the finite field of order p, for infinitely many primes p, preserving all algebraic incidences in S. This can be seen as a generalization of the…

Combinatorics · Mathematics 2011-08-16 Van H. Vu , Melanie Matchett Wood , Philip Matchett Wood

Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…

Group Theory · Mathematics 2023-09-29 Nikolay Nikolov

We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…

Combinatorics · Mathematics 2013-10-02 Keith Mellinger , Ryan Vaughn , Oscar Vega

One can embed arbitrarily many disjoint, non-parallel, non-boundary parallel, incompressible surfaces in any three manifold with at least one boundary component of genus two or greater [4]. This paper proves the contrasting, but not…

Geometric Topology · Mathematics 2007-05-23 Hugh Nelson Howards

We characterize all permutations which realize as the $z$-monodromies of faces in connected simple finite graphs embedded in surfaces whose duals are also simple.

Combinatorics · Mathematics 2023-08-29 Adam Tyc

Motivated by constructions from applied topology, there has been recent interest in the homological algebra of linear representations of posets, particularly in the context of homological algebra relative to non-standard exact structures. A…

Representation Theory · Mathematics 2025-07-18 Benjamin Blanchette , Justin Desrochers , Eric J. Hanson , Luis Scoccola

We prove that every biregular automorphism of the affine algebraic variety ${\mathbb P}^M\setminus S$, $M\geqslant 3$, where $S\subset {\mathbb P}^M$ is a hypersurface of degree $m\geqslant M+1$ with a unique singular point of multiplicity…

Algebraic Geometry · Mathematics 2018-05-09 Aleksandr V. Pukhlikov

We consider finitary approximations of the (embedding) Ramsey property. Using a class of homogeneous reducts of random ordered hypergraphs, we prove that these properties form a strict hierarchy. We also show that every class of finite…

Combinatorics · Mathematics 2023-07-28 Nadav Meir , Aris Papadopoulos

This is the third 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

We introduce associative embedding, a novel method for supervising convolutional neural networks for the task of detection and grouping. A number of computer vision problems can be framed in this manner including multi-person pose…

Computer Vision and Pattern Recognition · Computer Science 2017-06-12 Alejandro Newell , Zhiao Huang , Jia Deng

The class of generic structures among those consisting of the measure algebra of a probability space equipped with an automorphism is axiomatizable by positive sentences interpreted using an approximate semantics. The separable generic…

Logic · Mathematics 2007-05-23 Alexander Berenstein , C. Ward Henson

We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order logic, a natural extension of monadic second-order logic), and to be recognizable in an algebraic framework induced by…

Logic in Computer Science · Computer Science 2007-05-23 Pascal Weil