Related papers: Arc criterion of normal embedding

We introduce $(k,l)$-regular maps, which generalize two previously studied classes of maps: affinely $k$-regular maps and totally skew embeddings. We exhibit some explicit examples and obtain bounds on the least dimension of a Euclidean…

The normal form for a system of ode's is constructed from its polynomial symmetries of the linear part of the system, which is assumed to be semi-simple. The symmetries are shown to have a simple structure such as invariant function times…

Let $H$ and $G$ be graphs on $n$ vertices, where $n$ is sufficiently large. We prove that if $H$ has Ore-degree at most 5 and $G$ has minimum degree at least $2n/3$ then $H\subset G.$

The embedding of a given point set with non-crystallographic symmetry into higher-dimensional space is reviewed, with special emphasis on the Minkowski embedding known from number theory. This is a natural choice that does not require an a…

A semiring is uniserial if its ideals are totally ordered by inclusion. First, we show that a semiring $S$ is uniserial if and only if the matrix semiring $M_n(S)$ is uniserial. As a generalization of valuation semirings, we also…

We show that every semialgebraic set admits a semialgebraic triangulation such that each closed simplex is $C^1$ differentiable. As an application, we give a straightforward definition of the integration $\int_X \omega$ over a compact…

We show that a rational normal scroll can in general be set-theoretically defined by a proper subset of the 2-minors of the associated two-row matrix. This allows us to find a class of rational normal scrolls that are almost set-theoretic…

We generalize the Embedding Theorem of Eisenbud-Harris from classical Brill-Noether theory to the setting of Hurwitz-Brill-Noether theory. More precisely, in classical Brill-Noether theory, the embedding theorem states that a general linear…

To represent anything from mathematical concepts to real-world objects, we have to resort to an encoding. Encodings, such as written language, usually assume a decoder that understands a rich shared code. A semantic embedding is a form of…

Learning distributed representations for nodes in graphs is a crucial primitive in network analysis with a wide spectrum of applications. Linear graph embedding methods learn such representations by optimizing the likelihood of both…

Let N be a finitely generated module over a Noetherian local ring (R,m). We give criteria for the height of the order ideal N^*(x) of an element x \in N to be bounded by the rank of N. The Generalized Principal Ideal Theorem of Bruns,…

We classify contact manifolds $(M,\mathcal D)$ which are homogeneous under a connected semisimple Lie group $G$, and symmetric in the sense that there exists a contactomorphism of $(M,\mathcal D)$ normalizing $G$, fixing a point $o$ in $M$…

Let K be an algebraically closed field of characteristic zero, endowed with a complete nonarchimedean norm. Let X be a K-rigid analytic variety and \Sigma a semianalytic subset of X. Then the closure of \Sigma in X with respect to the…

Given a number field $F$ and $R$ be the ring of integers of $F$, the problem of embedding a field extension $K/F$ into a central simple algebra $B$ is classical. This paper proves that when the central simple algebra has degree $p$, the…

'A semigroup is completely regular if and only if it is a union of groups'- an analogue of this structure theorem of completely regular semigroup has been obtained in the setting of seminearrings in [[16], Mukherjee (Pal) et al., Semigroup…

In this paper we deal with a best approximation of a vector with respect to a closed semi-algebraic set $C$ in the space $\mathbb{R}^n$ endowed with a semi-algebraic norm $\nu$. Under additional assumptions on $\nu$ we prove…

The central theorem of topological graph theory states that the graph minor relation is a well-quasi-order on graphs. It has far-reaching consequences, in particular in the study of graph structures and the design of (parameterized)…

We prove a conjecture of Kurdyka stating that every arc-symmetric semialgebraic set is precisely the zero locus of an arc-analytic semialgebraic function. This implies, in particular, that arc-symmetric semialgebraic sets are in one-to-one…

Whether the goal is to analyze voting behavior, locate facilities, or recommend products, the problem of translating between (ordinal) rankings and (numerical) utilities arises naturally in many contexts. This task is commonly approached by…

We consider the number of crossings in a graph which is embedded randomly on a convex set of points. We give an estimate to the normal distribution in Kolmogorov distance which implies a convergence rate of order $n^{-1/2}$ for various…