English
Related papers

Related papers: Rectifiability and finite variation

200 papers

A Radon measure $\mu$ is $n$-rectifiable if it is absolutely continuous with respect to $\mathcal{H}^n$ and $\mu$-almost all of $\text{supp}\,\mu$ can be covered by Lipschitz images of $\mathbb{R}^n$. In this paper we give two sufficient…

Classical Analysis and ODEs · Mathematics 2021-08-06 Damian Dąbrowski

Given the set of paths through a digraph, the result of uniformly deleting some vertices and identifying others along each path is coherent in such a way as to yield the set of paths through another digraph, called a \emph{path abstraction}…

Combinatorics · Mathematics 2017-01-27 Steve Huntsman

We prove a unified and general criterion for the uniqueness of critical points of a functional in the presence of constraints such as positivity, boundedness, or fixed mass. Our method relies on convexity properties along suitable paths and…

Analysis of PDEs · Mathematics 2016-07-20 Denis Bonheure , Juraj Földes , Ederson Moreira dos Santos , Alberto Saldaña , Hugo Tavares

We shall show that for {\it any} $MA(2)$ process (apart from those with coefficients $\theta_1,\theta_2 $ lying on certain line-segments) there is {\it one and only one invertible} $MA(2)$ process with the {\it same} autocovariances…

Statistics Theory · Mathematics 2014-05-29 Simon Ku , Eugene Seneta

We prove two dichotomy results for detecting long paths as patterns in a given graph. The NP-hard problem Longest Induced Path is to determine the longest induced path in a graph. The NP-hard problem Longest Path Contractibility is to…

Data Structures and Algorithms · Computer Science 2018-10-04 Walter Kern , Daniel Paulusma

Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…

Combinatorics · Mathematics 2020-07-21 Hendrik Heine

We prove that the length difference between a closed periodic curve and its parallel curve at a sufficiently small distance is proportional to the rotation index. As an application, the rotation index of a curve could be estimated by means…

Differential Geometry · Mathematics 2007-11-13 Enrique Macias Virgós

We investigate modularity of elliptic curves over a general totally real number field, establishing a finiteness result for the set non-modular $j$-invariants. By analyzing quadratic points on some modular curves, we show that all elliptic…

Number Theory · Mathematics 2013-09-18 Bao V. Le Hung

Consider the extreme value of a Bernoulli random walk on the one-dimensional integer lattice, with reflection at 0, over a finite discrete time interval. Only the asymmetric (biased) case is discussed. Asymptotic mean/variance results are…

History and Overview · Mathematics 2018-08-27 Steven R. Finch

Using fractional calculus we define integrals of the form $% \int_{a}^{b}f(x_{t})dy_{t}$, where $x$ and $y$ are vector-valued H\"{o}lder continuous functions of order $\displaystyle \beta \in (\frac13, \frac12)$ and $f$ is a continuously…

Probability · Mathematics 2007-05-23 Yaozhong Hu , David Nualart

Let $f$ be a permutation from $\mathbb{N}_0$ onto $\mathbb{N}_0$. Let $x\in\mathbb{N}_0$ and consider a (finite or infinite) sequence $s= (x,f(x),f^2(x),\cdots)$. We call $s$ a permutation sequence. Let $D$ be the set of elements of $s$. If…

Number Theory · Mathematics 2022-05-30 John L Simons

Two Hamilton paths in $K_n$ are separated by a cycle of length $k$ if their union contains such a cycle. For small fixed values of $k$ we bound the asymptotics of the maximum cardinality of a family of Hamilton paths in $K_n$ such that any…

Combinatorics · Mathematics 2016-05-05 Gérard Cohen , Emanuela Fachini , János Körner

We consider linear single-path loops of the form \[ \textbf{while} \quad \varphi \quad \textbf{do} \quad \vec{x} \gets A \vec{x} + \vec{b} \quad \textbf{end} \] where $\vec{x}$ is a vector of variables, the loop guard $\varphi$ is a…

Logic in Computer Science · Computer Science 2026-01-14 Florian Frohn , Jürgen Giesl , Peter Giesl , Nils Lommen

An interesting open problem in number theory asks whether it is possible to walk to infinity on primes, where each term in the sequence has one more digit than the previous. In this paper, we study its variation where we walk on the…

Number Theory · Mathematics 2022-08-30 Steven J. Miller , Fei Peng , Tudor Popescu , Nawapan Wattanawanichkul

We generalize the notion of length to an ordinal-valued invariant defined on the class of finitely generated modules over a Noetherian ring. A key property of this invariant is its semi-additivity on short exact sequences. We show how to…

Commutative Algebra · Mathematics 2013-09-27 Hans Schoutens

We define and investigate the properties of the jaggedness of path integral trajectories. The new quantity is shown to be scale invariant and to satisfy a self-averaging property. Jaggedness allows for a classification of path integral…

Statistical Mechanics · Physics 2011-08-08 Aleksandar Bogojevic , Antun Balaz , Aleksandar Belic

In this work we obtain recurrent formulae for the number of permutations with either increasing or monotonic (i.e., both increasing and decreasing) runs of bounded length. Our formulae allow one to efficiently compute the number of such…

Combinatorics · Mathematics 2013-02-25 Max A. Alekseyev

Tracking the solution of time-varying variational inequalities is an important problem with applications in game theory, optimization, and machine learning. Existing work considers time-varying games or time-varying optimization problems.…

Computer Science and Game Theory · Computer Science 2026-03-05 Hédi Hadiji , Sarah Sachs , Cristóbal Guzmán

Quantum area tensor Regge calculus is considered, some properties are discussed. The path integral quantisation is defined for the usual length-based Regge calculus considered as a particular case (a kind of a state) of the area tensor…

General Relativity and Quantum Cosmology · Physics 2007-05-23 V. M. Khatsymovsky

Following the work of Cano and Diaz, we consider a continuous analog of lattice path enumeration. This allows us to define a continuous version of any discrete object that counts certain types of lattice paths. We define continuous versions…

Combinatorics · Mathematics 2017-08-09 T. Wakhare , C. Vignat , Q. -N. Le , S. Robins
‹ Prev 1 8 9 10 Next ›