Related papers: The Chord Construction

In this paper we describe a physical problem, based on electromagnetic fields, whose topological constraints are higher dimensional versions of Kirchhoff's laws, involving $2-$ simplicial complexes embedded in $\mathbb{R} ^3$ rather than…

Call a simple graph $H$ of order $n$ well-separable, if by deleting a separator set of size $o(n)$ the leftover will have components of size at most $o(n)$. We prove, that bounded degree well-separable spanning subgraphs are easy to embed:…

Let K/F be a cyclic field extension of odd prime degree. We consider Galois embedding problems involving Galois groups with common quotient Gal(K/F) such that corresponding normal subgroups are indecomposable Fp[Gal(K/F)]-modules. For these…

Let $G$ be a split connected reductive group over a finite extension $F$ of $Q_p$. We determine the extensions between unitary continuous $p$-adic and smooth mod $p$ principal series of $G(F)$ in the generic case. In order to do so, we…

In this article we present a unified way to smooth certain multiple structures called ropes on smooth varieties. We prove that most ropes of arbitrary multiplicity, supported on smooth curves can be smoothed. By a rope being smoothable we…

We denote by $\mathcal{H}_{d,g,r}$ the Hilbert scheme of smooth curves, which is the union of components whose general point corresponds to a smooth, irreducible and non-degenerate curve of degree $d$ and genus $g$ in $\mathbb{P}^r.$ In…

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…

Given a distribution of pebbles on the vertices of a graph G, a {\it pebbling move} takes two pebbles from one vertex and puts one on a neighboring vertex. The {\it pebbling number} \Pi(G) is the minimum k such that for every distribution…

Let $S_{g,1,p}$ be an orientable surface of genus $g$ with one boundary component and $p$ punctures. Let $\mathcal{M}_{g,1,p}$ be the mapping-class group of $S_{g,1,p}$ relative to the boundary. We construct homomorphisms…

We show that the independence complex of a chordal graph is contractible if and only if this complex is dismantlable (strong collapsible) and it is homotopy equivalent to a sphere if and only if its core is a cross-polytopal sphere. The…

An upward planar order on an acyclic directed graph $G$ is a special linear extension of the edge poset of $G$ that satisfies the nesting condition. This order was introduced to combinatorially characterize upward plane graphs and…

In a graph $G$, we define a set of vertices to be a \emph{strong hub set} if for any two vertices in $G$, we can find a path between them whose internal vertices are all in this set. We define the \emph{strong hub cover pebbling number} of…

We prove that a simple knot in the lens space $L(p,q)$ fibers if and only if its order in homology does not divide any remainder occurring in the Euclidean algorithm applied to the pair $(p,q)$. One corollary is that if $p=m^2$ is a perfect…

Let $\mathcal C :f=0$ be a curve arrangement in the complex projective plane. If $\mathcal C$ contains a curve subarrangement consisting of at least three members in a pencil, then one obtains an explicit syzygy among the partial…

In a graph G with a distribution of pebbles on its vertices, a pebbling move is the removal of two pebbles from one vertex and the addition of one pebble to an adjacent vertex. A weight function on G is a non-negative integer-valued…

A {\em $(d,h)$-decomposition} of a graph $G$ is an order pair $(D,H)$ such that $H$ is a subgraph of $G$ where $H$ has the maximum degree at most $h$ and $D$ is an acyclic orientation of $G-E(H)$ of maximum out-degree at most $d$. A graph…

This note studies the structure of the divisorial fixed part of the dualizing sheaf of a 1-connected curve D on a smooth surface S. It is shown that if the divisorial fixed part F of the dualizing sheaf is non empty then it has arithmetic…

A set $\mathcal{G}$ of planar graphs on the same number $n$ of vertices is called simultaneously embeddable if there exists a set $P$ of $n$ points in the plane such that every graph $G \in \mathcal{G}$ admits a (crossing-free)…

Let p>3 be a prime and let E, E' be supersingular elliptic curves over F_p. We want to construct an isogeny phi: E --> E'. The currently fastest algorithm for finding isogenies between supersingular elliptic curves solves this problem by…

For any chord diagram on a circle there exists a complete graph on sufficiently many vertices such that any generic immersion of it to the plane contains a plane closed curve whose chord diagram contains the given chord diagram as a…