English
Related papers

Related papers: On Minc's sheltered middle path

200 papers

Classical H.Minkowski theorems on existence and uniqueness of convex polyhedra with prescribed directions and areas of faces as well as the well-known generalization of H.Minkowski uniqueness theorem due to A.D.Alexandrov are extended to a…

Metric Geometry · Mathematics 2007-05-23 Victor Alexandrov

For a set of curves, Ahn et al. introduced the notion of a middle curve and gave algorithms computing these with run time exponential in the number of curves. Here we study the computational complexity of this problem: we show that it is…

Computational Geometry · Computer Science 2020-01-29 Maike Buchin , Nicole Funk , Amer Krivošija

We refine and generalize the results of e-Print: 2307.10428 [hep-th], where evidence in favor of applying the non-Abelian localization method to handle the 4d Chern-Simons theory path integral formulation was presented. We show, via duality…

High Energy Physics - Theory · Physics 2025-12-15 David M. Schmidtt

The signature of a $p$-weakly geometric rough path summarises a path up to a generalised notion of reparameterisation. The quotient space of equivalence classes on which the signature is constant yields unparameterised path space. The study…

Classical Analysis and ODEs · Mathematics 2024-07-26 Thomas Cass , William F. Turner

We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, we establish bijections between sets of such paths and other combinatorial structures, such as non-crossing trees, dissections of a convex polygon,…

Combinatorics · Mathematics 2007-05-23 Andrei Asinowski , Toufik Mansour

This paper presents and explores a theory of \emph{multiholomorphic maps}. This group of ideas generalizes the theory of pseudoholomorphic curves in a direction suggested by consideration of the kinds of compatible geometric structures that…

Differential Geometry · Mathematics 2012-05-01 Aaron M. Smith

We give a new proof of Mikhalkin's Theorem on the topological classification of simple Harnack curves, which in particular extends Mikhalkin's result to real pseudoholomorphic curves.

Algebraic Geometry · Mathematics 2015-04-21 Erwan Brugalle

The signature of a path, introduced by K.T. Chen [5] in $1954$, has been extensively studied in recent years. The $2010$ paper [12] of Hambly and Lyons showed that the signature is injective on the space of continuous finite-variation paths…

Classical Analysis and ODEs · Mathematics 2022-06-30 Thomas Cass , William F. Turner

We discuss the existence of vertex disjoint path coverings with prescribed ends for the $n$-dimensional hypercube with or without deleted vertices. Depending on the type of the set of deleted vertices and desired properties of the path…

Combinatorics · Mathematics 2013-12-09 Nelson Castañeda , Ivan S. Gotchev

We introduce and study the new combinatorial class of Dyck paths with air pockets. We exhibit a bijection with the peakless Motzkin paths which transports several pattern statistics and give bivariate generating functions for the…

Discrete Mathematics · Computer Science 2023-03-07 Jean-Luc Baril , Sergey Kirgizov , Rémi Maréchal , Vincent Vajnovszki

The 1-2-3 Conjecture, introduced by Karo\'nski, {\L}uczak, and Thomason in 2004, was recently solved by Keusch. This implies that, for any connected graph $G$ different from $K_2$, we can turn $G$ into a locally irregular multigraph $M(G)$,…

Discrete Mathematics · Computer Science 2025-06-27 Julien Bensmail , Romain Bourneuf , Paul Colinot , Samuel Humeau , Timothée Martinod

We extend the notion of unicorn paths between two arcs introduced by Hensel, Przytycki and Webb to the case where we replace one arc with a geodesic asymptotic to a lamination. Using these paths, we give new proofs of the results of…

Geometric Topology · Mathematics 2015-11-04 Witsarut Pho-on

We generalize the shuffle theorem and its $(km,kn)$ version, as conjectured by Haglund et al. and Bergeron et al., and proven by Carlsson and Mellit, and Mellit, respectively. In our version the $(km,kn)$ Dyck paths on the combinatorial…

Combinatorics · Mathematics 2021-09-07 Jonah Blasiak , Mark Haiman , Jennifer Morse , Anna Pun , George H. Seelinger

In [Ann. of Math. 169 (2009)], Min Ru proved a second main theorem for algebraically nondegenerate holomorphic curves in complex projective varieties intersecting fixed hypersurface targets. In this paper, by introducing a new proof method…

Complex Variables · Mathematics 2018-11-13 Gerd Dethloff , Tran Van Tan

A Littelmann path model is constructed for crystals pertaining to a not necessarily symmetrizable Borcherds-Cartan matrix. Here one must overcome several combinatorial problems coming from the imaginary simple roots. The main results are an…

Representation Theory · Mathematics 2014-08-06 Anthony Joseph , Polyxeni Lamprou

A tuple (s1,t1,s2,t2) of vertices in a simple undirected graph is 2-linked when there are two vertex-disjoint paths respectively from s1 to t1 and s2 to t2. A graph is 2-linked when all such tuples are 2-linked. We give a new and simple…

Data Structures and Algorithms · Computer Science 2025-08-15 Samuel Humeau , Damien Pous

The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length $n$ with $m$ flaws is the $n$-th Catalan number and independent on $m$. In this paper, we consider the refinements of Dyck paths with flaws by four…

Combinatorics · Mathematics 2008-12-16 Jun Ma , Yeong-Nan Yeh

The toric manifolds in question were invented by Bott and studied by Grossberg and Karshon under the name "Bott towers". Interest in them comes from their relation to characters of semisimple Lie groups and geometric quantization. We offer…

Symplectic Geometry · Mathematics 2007-05-23 Wulf Rossmann

We present a model for a Chern insulator on the square lattice with complex first and second neighbor hoppings and a sublattice potential which displays an unexpectedly rich physics. Similarly to the celebrated Haldane model, the proposed…

Mesoscale and Nanoscale Physics · Physics 2025-02-19 Miguel Gonçalves , Pedro Ribeiro , Eduardo V. Castro

The Induced Disjoint Paths problem is to test whether a graph G with k distinct pairs of vertices (s_i,t_i) contains paths P_1,...,P_k such that P_i connects s_i and t_i for i=1,...,k, and P_i and P_j have neither common vertices nor…

Data Structures and Algorithms · Computer Science 2014-03-05 Petr A. Golovach , Daniël Paulusma , Erik Jan van Leeuwen
‹ Prev 1 2 3 10 Next ›