English
Related papers

Related papers: Caterpillars and alternating paths

200 papers

It has recently been shown that any simple (i.e. nonintersecting) polygonal chain in the plane can be reconfigured to lie on a straight line, and any simple polygon can be reconfigured to be convex. This result cannot be extended to tree…

The main result of this paper is that if E is a field extension of finite odd degree over a real field Q, and if E is a repeated radical extension of Q, then every intermediate field is also a repeated radical extension of Q. This paper…

Number Theory · Mathematics 2008-02-03 I. M. Isaacs , David Petrie Moulton

A leaper is a chess piece which generalises the knight. Given $n$ and a $(p, q)$-leaper $L$, we study the greatest $m$ such that the $m \times m$ grid graph can be embedded into the $n \times n$ leaper graph of $L$. We can assume that $p$…

Combinatorics · Mathematics 2025-03-25 Nikolai Beluhov

We give a general construction of triangulations starting from a walk in the quarter plane with small steps, which is a discrete version of the mating of trees. We use a special instance of this construction to give a bijection between maps…

Combinatorics · Mathematics 2021-02-01 Philippe Biane

In this paper we study planar morphs between straight-line planar grid drawings of trees. A morph consists of a sequence of morphing steps, where in a morphing step vertices move along straight-line trajectories at constant speed. We show…

We show that conformal transformations on the generalized Minkowski space $\mathbb{R}^{p,q}$ map hyperboloids and affine hyperplanes into hyperboloids and affine hyperplanes. We also show that this action on hyperboloids and affine…

Differential Geometry · Mathematics 2015-03-04 Matvei Libine , Surya Raghavendran

We analyse q-functional equations arising from tree-like combinatorial structures, which are counted by size, internal path length, and certain generalisations thereof. The corresponding counting parameters are labelled by a positive…

Combinatorics · Mathematics 2008-12-02 Christoph Richard

We study bipartite maps on the plane with one infinite face and one face of perimeter 2. At first we consider the problem of their enumeration an then study the connection between the combinatorial structure of a map and the degree of its…

Combinatorics · Mathematics 2017-06-30 Yury Kochetkov

The $k$-plane transform is a bounded operator from $\lp$ to $L^q$ of the Grassmann manifold of all affine $k$-planes in $\R^n$ for certain exponents depending on $k$ and $n$. In the endpoint case $q=n+1$, we identify all extremizers of the…

Classical Analysis and ODEs · Mathematics 2013-09-24 Taryn C. Flock

This paper studies a \emph{packing} problem in the so-called beyond-planar setting, that is when the host graph is ``almost-planar'' in some sense. Precisely, we consider the case that the host graph is $k$-planar, i.e., it admits an…

Combinatorics · Mathematics 2023-01-04 Carla Binucci , Emilio Di Giacomo , Michael Kaufmann , Giuseppe Liotta , Alessandra Tappini

We study the problem of finding the largest number $T(n, m)$ of ternary vectors of length $n$ such that for any three distinct vectors there are at least $m$ coordinates where they pairwise differ. For $m = 1$, this is the classical…

Let $K$ be a field, $Q$ a quiver, and $\mathcal{A}$ the ideal of the path algebra $KQ$ that is generated by the arrows of $Q$. We present old and new results about the representation theories of the truncations $KQ/\mathcal{A}^L$, $L \in…

Representation Theory · Mathematics 2024-12-18 K. R. Goodearl , B. Huisgen-Zimmermann

We prove that the spanning trees of any outerplanar triangulation $G$ can be listed so that any two consecutive spanning trees differ in an exchange of two edges that share an end vertex. For outerplanar graphs $G$ with faces of arbitrary…

Discrete Mathematics · Computer Science 2024-12-23 Nastaran Behrooznia , Torsten Mütze

A well known Euler's formula consequence's corollary in graph theory states that: For a connected simple planar graph with $n$ vertices and $m$ edges, and girth $g$, we have $m \leq \frac{g}{g-2}(n-2)$. We show that a connected simple plane…

Combinatorics · Mathematics 2017-08-08 Niran Abbas Ali , Gek L. Chiab , Hazim Michman Trao , Adem Kilicman

We find exact and asymptotic formulas for the number of pairs $(p,q)$ of $N$-cycles such that the all cycles of the product $p\cdot q$ have lengths from a given integer set. We then apply these results to prove a surprisingly high lower…

Combinatorics · Mathematics 2024-10-28 Miklos Bona , Boris Pittel

General structure of the multivariate plain and q-hypergeometric terms and univariate elliptic hypergeometric terms is described. Some explicit examples of the totally elliptic hypergeometric terms leading to multidimensional integrals on…

Classical Analysis and ODEs · Mathematics 2014-07-01 V. P. Spiridonov

Closed-form generating functions for counting one-face rooted hypermaps with a known number of darts by number of vertices and edges is found, using matrix integral expressions relating to the reduced density operator of a bipartite quantum…

Combinatorics · Mathematics 2015-01-28 Jacob P. Dyer

Let $K$ be the graph on vertices $\{1, 2, 3, 4, 5\}$, and having all edges except $(4, 5)$. A continuous map $f:K\to \R^2$ is called an \emph{almost embedding} if $f$-images of non-adjacent edges are disjoint. Take the winding numbers of…

Combinatorics · Mathematics 2025-06-03 T. R. Garaev

Topological drawings are representations of graphs in the plane, where vertices are represented by points, and edges by simple curves connecting the points. A drawing is simple if two edges intersect at most in a single point, either at a…

Computational Geometry · Computer Science 2022-09-08 Alfredo García , Alexander Pilz , Javier Tejel

We derive parametric travelling-wave solutions of non-linear QCD equations. They describe the evolution towards saturation in the geometric scaling region. The method, based on an expansion in the inverse of the wave velocity, leads to a…

High Energy Physics - Phenomenology · Physics 2008-11-26 R. Peschanski
‹ Prev 1 8 9 10 Next ›