English
Related papers

Related papers: Directed and irreversible path in Euclidean spaces

200 papers

We study the NP-hard Shortest Path Most Vital Edges problem arising in the context of analyzing network robustness. For an undirected graph with positive integer edge lengths and two designated vertices $s$ and $t$, the goal is to delete as…

Computational Complexity · Computer Science 2018-04-25 Cristina Bazgan , Till Fluschnik , André Nichterlein , Rolf Niedermeier , Maximilian Stahlberg

In rotor walk on a finite directed graph, the exits from each vertex follow a prescribed periodic sequence. Here we consider the case of rotor walk where a particle starts from a designated source vertex and continues until it hits a…

Combinatorics · Mathematics 2013-04-04 Giuliano Pezzolo Giacaglia , Lionel Levine , James Propp , Linda Zayas-Palmer

A directed diameter of a directed graph is the maximum possible distance between a pair of vertices, where paths must respect edge orientations, while undirected diameter is the diameter of the undirected graph obtained by symmetrizing the…

Combinatorics · Mathematics 2025-03-04 Saveliy V. Skresanov

We show that weighted path orders are special instances of a variant of semantic path orders. Exploiting this fact, we introduce a generalization of weighted path orders that goes beyond the realm of simple termination. Experimental data…

Logic in Computer Science · Computer Science 2023-07-27 Teppei Saito , Nao Hirokawa

We consider the inverse curvature flows $\dot x=F^{-p}\nu$ of closed star-shaped hypersurfaces in Euclidean space in case $0<p\not=1$ and prove that the flow exists for all time and converges to infinity, if $0<p<1$, while in case $p>1$,…

Differential Geometry · Mathematics 2014-05-01 Claus Gerhardt

We point out that the total number of trails and the total number of paths of given length, between two vertices of a simple undirected graph, are obtained as expectation values of specifically engineered quantum mechanical observables.…

Combinatorics · Mathematics 2009-11-13 Fotini Markopoulou , Simone Severini

We prove that the space of smooth rational curves of degree $e$ in a general complete intersection of multidegree $(d_1, ..., d_m)$ in $\PP^n$ is irreducible of the expected dimension if $\sum_{i=1}^m d_i <\frac{2n}{3}$ and $n$ is large…

Algebraic Geometry · Mathematics 2019-02-20 Roya Beheshti , N. Mohan Kumar

We show that with any finite partially ordered set one can associate a matrix whose determinant factors nicely. As corollaries, we obtain a number of results in the literature about GCD matrices and their relatives. Our main theorem is…

Combinatorics · Mathematics 2007-05-23 Ercan Altinisik , Bruce E. Sagan , Naim Tuglu

When a real fluid is expelled quickly from a tube, it forms a jet separated from the surrounding fluid by a thin, turbulent layer. On the other hand, when the same fluid is sucked into the tube, it comes in from all directions, forming a…

Fluid Dynamics · Physics 2014-10-27 Alejandro Jenkins

We give upper bounds on the number of exceptional radial projections of arbitrary subsets of vector spaces over finite fields. Our bounds do not depend on the dimension of the ambient space. Let $\mathbb{F}_q^d$ be the $d$-dimensional…

Combinatorics · Mathematics 2025-12-01 Paige Bright , Ben Lund , Thang Pham

The main result given in Theorem~1.1 is a condition for a map $X$, defined on the complement of a disk $D$ in R^2 with values in R^2, to be extended to a topological embedding of R^2, not necessarily surjective. The map $X$ is supposed to…

Dynamical Systems · Mathematics 2007-05-23 Carlos Gutierrez , Roland Rabanal

We discuss measures on spaces of unparametrized paths related to the Wiener measure. These measures arise naturally in the study of one-dimensional gravity coupled to scalar fields. Two kinds of discrete approximations are defined, the…

Mathematical Physics · Physics 2015-06-26 B. Durhuus , T. Jonsson

We give certain properties which are satisfied by the descendant set of a vertex in an infinite, primitive, distance transitive digraph of finite out-valency and provide a strong structure theory for digraphs satisfying these properties. In…

Combinatorics · Mathematics 2015-09-03 Daniela Amato , David M. Evans

In this paper we explore mathematical tools that can be used to relate directed and undirected random graph models to each other. We identify probability spaces on which a directed and an undirected graph model are equivalent, and…

Probability · Mathematics 2025-03-03 Mike van Santvoort , Pim van der Hoorn

Let $U$ be a point set in the $n$-dimensional affine space ${\rm AG}(n,q)$ over the finite field of $q$ elements and $0\leq k\leq n-2$. In this paper we extend the definition of directions determined by $U$: a $k$-dimensional subspace $S_k$…

Combinatorics · Mathematics 2014-07-22 Péter Sziklai , Marcella Takáts

We study the number $N\_n$ of open paths of length $n$ in supercritical oriented percolation on $\Zd \times \N$, with $d \ge 1$. We prove that on the percolation event $\{\inf N\_n\textgreater{}0\}$, $N\_n^{1/n}$ almost surely converges to…

Probability · Mathematics 2015-03-06 Olivier Garet , Jean-Baptiste Gouéré , Régine Marchand

Two discrete dynamical systems are discussed and analyzed whose trajectories encode significant explicit information about a number of problems in combinatorial probability, including graphical enumeration on Riemann surfaces and random…

Exactly Solvable and Integrable Systems · Physics 2019-01-25 Tova Brown , Nicholas M. Ercolani

In this work, we establish a general relationship between the enumeration of weighted directed paths and skew Schur functions, extending work by Bousquet-M\'elou, who expressed generating functions of discrete excursions in terms of…

Combinatorics · Mathematics 2020-09-29 Anum Khalid , Thomas Prellberg

An argument is given to associate integrable nonintegrable transition of discrete maps with the transition of Lawvere's fixed point theorem to its own contrapositive. We show that the classical description of nonlinear maps is neither…

Dynamical Systems · Mathematics 2016-02-29 S. Saito , N. Saitoh , T. Hatanaka , Y. Wakimoto , T. Yumibayashi

We study the Erdos distance problem over finite Euclidean and non-Euclidean spaces. Our main tools are graphs associated to finite Euclidean and non-Euclidean spaces that are considered in Bannai-Shimabukuro-Tanaka (2004, 2007). These…

Combinatorics · Mathematics 2008-02-09 Le Anh Vinh