English
Related papers

Related papers: Embeddability of joinpowers, and minimal rank of p…

200 papers

We study a natural model of random 2-dimensional cubical complex which is a subcomplex of an n-dimensional cube, and where every possible square $2$-face is included independently with probability p. Our main result is to exhibit a sharp…

Combinatorics · Mathematics 2020-09-21 Matthew Kahle , Elliot Paquette , Érika Roldán

We study some graphs associated to a surface, called k-multicurve graphs, which interpolate between the curve complex and the pants graph. Our main result is that, under certain conditions, simplicial embeddings between multicurve graphs…

Geometric Topology · Mathematics 2016-04-01 Viveka Erlandsson , Federica Fanoni

We study the potentially undecidable problem of whether a given 2-dimensional CW complex can be embedded into $\mathbb{R}^4$. We provide operations that preserve embeddability, including joining and cloning of 2-cells, as well as…

Combinatorics · Mathematics 2024-08-26 Agelos Georgakopoulos , Martin Winter

The $\gamma_2$-norm of Boolean matrices plays an important role in communication complexity and discrepancy theory. In this paper, we study combinatorial properties of this norm, and provide new applications, involving Zarankiewicz type…

Combinatorics · Mathematics 2025-03-04 István Tomon

An immersion of a smooth $n$-dimensional manifold $M \to \mathbb{R}^q$ is called totally nonparallel if, for every distinct $x, y \in M$, the tangent spaces at $f(x)$ and $f(y)$ contain no parallel lines. Given a manifold $M$, we seek the…

Geometric Topology · Mathematics 2020-07-30 Michael Harrison

In this paper we investigate the problem of non-analytic embeddings of Lorentzian manifolds in Ricci-flat semi-Riemannian spaces. In order to do this, we first review some relevant results in the area, and then motivate both the…

General Relativity and Quantum Cosmology · Physics 2018-05-22 Rodrigo Avalos , Fábio Dahia , Carlos Romero

We prove a general embedding theorem for Cohen--Macaulay curves (possibly nonreduced), and deduce a cheap proof of the standard results on pluricanonical embeddings of surfaces, assuming vanishing H^1(2K_X)=0.

alg-geom · Mathematics 2008-02-03 F. Catanese , M. Franciosi , K. Hulek , M. Reid

Denote by $\Delta_M$ the $M$-dimensional simplex. A map $f\colon \Delta_M\to\mathbb R^d$ is an almost $r$-embedding if $f\sigma_1\cap\ldots\cap f\sigma_r=\emptyset$ whenever $\sigma_1,\ldots,\sigma_r$ are pairwise disjoint faces. A…

Geometric Topology · Mathematics 2026-01-08 S. Avvakumov , R. Karasev , A. Skopenkov

We prove that over an algebraically closed field there is a representation embedding from the category of classical Kronecker-modules without the simple injective into the category of finite-dimensional modules over any…

Representation Theory · Mathematics 2023-05-30 Klaus Bongartz

We study the Linial--Meshulam model of random two-dimensional simplicial complexes. One of our main results states that for $p\ll n^{-1}$ a random 2-complex $Y$ collapses simplicially to a graph and, in particular, the fundamental group…

Algebraic Topology · Mathematics 2010-06-29 Armindo Costa , Michael Farber , Thomas Kappeler

Let $k_1,k_2$ be two fields of characteristic 0. Let $G_1$ be a split semisimple algebraic group over $k_1$, $G_2$ a split Kac--Moody group over $k_2$ and $\phi\colon G_1(k_1)\to G_2(k_2)$ an abstract embedding. We show that $\im \phi$ is a…

Group Theory · Mathematics 2011-09-06 Guntram Hainke

Let $M\subset\mathbb{R}^3$ be a properly embedded, connected, complete surface with boundary a convex planar curve $C$, satisfying an elliptic equation $H=f(H^2-K)$, where $H$ and $K$ are the mean and the Gauss curvature respectively -…

Differential Geometry · Mathematics 2025-10-07 Angelo Benedetti

We show that a pseudo-holomorphic embedding of an almost-complex $2n$-manifold into almost-complex $(2n + 2)$-Euclidean space exists if and only if there is a CR regular embedding of the $2n$-manifold into complex $(n + 1)$-space. We remark…

Differential Geometry · Mathematics 2018-04-24 Rafael Torres

We study the recognition complexity of subgraphs of k-connected planar cubic graphs for k = 1, 2, 3. We present polynomial-time algorithms to recognize subgraphs of 1- and 2-connected planar cubic graphs, both in the variable and fixed…

Discrete Mathematics · Computer Science 2024-10-15 Miriam Goetze , Paul Jungeblut , Torsten Ueckerdt

We show that if a non-degenerate PL map $f:N\to M$ lifts to a topological embedding in $M\times\mathbb R^k$ then it lifts to a PL embedding in there. We also show that if a stable smooth map $N^n\to M^m$, $m\ge n$, lifts to a topological…

Geometric Topology · Mathematics 2023-06-27 Sergey A. Melikhov

The classical theorem of F\'{a}ry states that every planar graph can be represented by an embedding in which every edge is represented by a straight line segment. We consider generalizations of F\'{a}ry's theorem to surfaces equipped with…

Computational Geometry · Computer Science 2017-08-29 Alfredo Hubard , Vojtěch Kaluža , Arnaud de Mesmay , Martin Tancer

We find the minimum number $k=\mu'(\Sigma)$ for any surface $\Sigma$, such that every $\Sigma$-embeddable non-bipartite graph is not $k$-extendable. In particular, we construct the so-called bow-tie graphs $C_6\bowtie P_n$, and show that…

Combinatorics · Mathematics 2015-01-23 Hongliang Lu , David G. L. Wang

We study the simultaneous embeddability of a pair of partitions of the same underlying set into disjoint blocks. Each element of the set is mapped to a point in the plane and each block of either of the two partitions is mapped to a region…

Computational Geometry · Computer Science 2014-08-27 Jan Christoph Athenstädt , Tanja Hartmann , Martin Nöllenburg

In this paper we will show the existence of a face $2$-colourable biembedding of the complete graph onto an orientable surface where each face is a cycle of a fixed length $k$, for infinitely many values of $k$. In particular, under certain…

Combinatorics · Mathematics 2019-08-12 Nicholas J. Cavenagh , D. Donovan , E. Ş. Yazici

For random graphs, the containment problem considers the probability that a binomial random graph $G(n,p)$ contains a given graph as a substructure. When asking for the graph as a topological minor, i.e., for a copy of a subdivision of the…

Combinatorics · Mathematics 2015-05-05 Anna Gundert , Uli Wagner