English
Related papers

Related papers: Basic embeddings and Hilbert's 13th problem

200 papers

A partially embedded graph (or PEG) is a triple (G,H,\H), where G is a graph, H is a subgraph of G, and \H is a planar embedding of H. We say that a PEG (G,H,\H) is planar if the graph G has a planar embedding that extends the embedding \H.…

Discrete Mathematics · Computer Science 2012-04-16 Vít Jelínek , Jan Kratochvíl , Ignaz Rutter

We establish an explicit embedding of a quantum affine $\mathfrak{sl}_n$ into a quantum affine $\mathfrak{sl}_{n+1}$. This embedding serves as a common generalization of two natural, but seemingly unrelated, embeddings, one on the quantum…

Quantum Algebra · Mathematics 2022-08-17 Yiqiang Li

Given a planar graph G and a sequence C_1,...,C_q, where each C_i is a family of vertex subsets of G, we wish to find a plane embedding of G, if any exists, such that for each i in {1,...,q}, there is a face F_i in the embedding whose…

Data Structures and Algorithms · Computer Science 2007-05-23 Zhi-Zhong Chen , Xin He , Ming-Yang Kao

Let $\mathcal{C}$ be a plane curve given by an equation $f(x,y)=0$ with $f\in K[x][y]$ a monic squarefree polynomial. We study the problem of computing an integral basis of the algebraic function field $K(\mathcal{C})$ and give new…

Symbolic Computation · Computer Science 2020-05-11 Simon Abelard

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

Kernel interpolation is a fundamental technique for approximating functions from scattered data, with a well-understood convergence theory when interpolating elements of a reproducing kernel Hilbert space. Beyond this classical setting,…

Numerical Analysis · Mathematics 2025-05-19 Toni Karvonen , Gabriele Santin , Tizian Wenzel

We present proofs of the basic isopermetric structure theory, obtaining some new simplified proofs. As an application, we obtain simple descriptions for subsets $S$ of an abelian group with $|kS|\le k|S|-k+1$ or $|kS-rS|- (k+r)|S|,$ where…

Combinatorics · Mathematics 2010-11-09 Yahya Ould Hamidoune

A map is a partition of the sphere into regions that are labeled as countries or holes. The vertices of a map graph are the countries of a map. There is an edge if and only if the countries are adjacent and meet in at least one point. For a…

Computational Geometry · Computer Science 2023-08-23 Franz J. Brandenburg

It is well-known that the embedding of the Sobolev space of weakly differentiable functions into H\"{o}lder spaces holds if the integrability exponent is higher than the space dimension. In this paper, the embedding of the Sobolev functions…

Functional Analysis · Mathematics 2024-12-17 Ugur G. Abdulla

Let $C$ be an affine curve over an algebraically closed field $k$ of characteristic $p>0$. Given an embedding problem $(\beta:\Gamma\longrightarrow G, \alpha: \pi^{et}_1(C)\longrightarrow G)$ for $\pi_1^{et}(C)$ where $\beta$ is a…

Algebraic Geometry · Mathematics 2024-03-07 Manish Kumar , Poulami Mandal

In [36, Section 8], the present author proposed the hypergraph obstruction for the existence of k-regular embeddings. In this paper, we develop the hypergraph obstruction concretely and give some homological obstructions for the k-regular…

Algebraic Topology · Mathematics 2026-01-12 Shiquan Ren

Let H be a graph, and let C_H(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating C_H(G). Previous results cover only a few specific instances of this general…

Data Structures and Algorithms · Computer Science 2019-02-20 Martin Furer , Shiva Prasad Kasiviswanathan

This paper presents primarily two Euclidean embeddings of the quotient space generated by matrices that are identified modulo arbitrary row permutations. The original application is in deep learning on graphs where the learning task is…

Functional Analysis · Mathematics 2022-03-16 Radu Balan , Naveed Haghani , Maneesh Singh

Here are two of our main results: Theorem 1. Let X be a normal space with dim X=n and m\geq n+1. Then the space C*(X,R^m) of all bounded maps from X into R^m equipped with the uniform convergence topology contains a dense G_{\delta}-subset…

General Topology · Mathematics 2015-06-26 Semeon Bogatyi , Vesko Valov

We study the existence of proper holomorphic embeddings of bordered Riemann surfaces into the complex plane C^2. Denote by M(R) the moduli space consisting of all equivalence classes of complex structures J on a given smooth oriented…

Complex Variables · Mathematics 2007-05-23 Miran Cerne , Franc Forstneric

Motivated by Tverberg-type problems in topological combinatorics and by classical results about embeddings (maps without double points), we study the question whether a finite simplicial complex K can be mapped into R^d without…

Geometric Topology · Mathematics 2016-10-19 Isaac Mabillard , Uli Wagner

We introduce the notion of $\lambda$-equivalence and $\lambda$-embeddings of objects in suitable categories. This notion specializes to $L_{\infty\lambda}$-equivalence and $L_{\infty\lambda}$-elementary embedding for categories of…

Category Theory · Mathematics 2020-12-04 Tibor Beke , Jiri Rosicky

A "folklore conjecture, probably due to Tutte" (as described in [P.D. Seymour, Sums of circuits, Graph theory and related topics (Proc. Conf., Univ. Waterloo, 1977), pp. 341-355, Academic Press, 1979]) asserts that every bridgeless cubic…

Combinatorics · Mathematics 2011-01-14 Bojan Mohar

Let G be a reductive algebraic group and H a closed subgroup of G. An affine embedding of the homogeneous space G/H is an affine G-variety with an open G-orbit isomorphic to G/H. We start with some basic properties of affine embeddings and…

Algebraic Geometry · Mathematics 2009-08-22 Ivan V. Arzhantsev

Graph representation learning plays an important role in many graph mining applications, but learning embeddings of large-scale graphs remains a problem. Recent works try to improve scalability via graph summarization -- i.e., they learn…

Machine Learning · Computer Science 2022-07-05 Houquan Zhou , Shenghua Liu , Danai Koutra , Huawei Shen , Xueqi Cheng