Related papers: Rectifiability and finite variation

To solve a linear program, the simplex method follows a path in the graph of a polytope, on which a linear function increases. The length of this path is an key measure of the complexity of the simplex method. Numerous previous articles…

We show that up to linear equivalence, there is only finitely many polynomial quadratic mappings $f:\Bbb C^2\to\Bbb C^2$ and $f:\Bbb R^2\to \Bbb R^2.$ We list all possibilities.

We use purely combinatorial arguments to give a formula to compute all graded Betti numbers of path ideals of line graphs and cycles. As a consequence we can give new and short proofs for the known formulas of regularity and projective…

Given a function f in the exterior of a convex curve in the real plane, we prove that if the restrictions of f to the tangent lines to the curve extend as entire functions, then the function f is an entire function of two variables.

We derive It\^o-type change of variable formulas for smooth functionals of irregular paths with non-zero $p-$th variation along a sequence of partitions where $p \geq 1$ is arbitrary, in terms of fractional derivative operators, extending…

We study a pathwise integral with respect to paths of finite quadratic variation, defined as the limit of non-anticipative Riemann sums for gradient-type integrands. We show that the integral satisfies a pathwise isometry property,…

We introduce the notions of tree-like path and tree-like equivalence between paths and prove that the latter is an equivalence relation for paths of finite length. We show that the equivalence classes form a group with some similarity to a…

We comment on a Mazur problem from "Scottish Book" concerning second partial derivatives. It is proved that, if a function $f(x,y)$ of real variables defined on a rectangle has continuous derivative with respect to $y$ and for almost all…

We consider the class of integer rectifiable currents without boundary satisfying a positivity condition. We establish that these currents can be written as a linear superposition of graphs of finitely many functions with bounded variation.

A linear constraint loop is specified by a system of linear inequalities that define the relation between the values of the program variables before and after a single execution of the loop body. In this paper we consider the problem of…

Within the context of rough path analysis via fractional calculus, we show how variability can be used to prove the existence of integrals with respect to H\"older continuous multiplicative functionals in the case of Lipschitz coefficients…

We consider the problem of finding an optimal piecewise linear path (polygonal line) connecting two given points with the possibility of making n turns at some points (the absolute value of each turn angle does not exceed a prescribed…

Let $E$ be a set in $\mathbb R^d$ with finite $n$-dimensional Hausdorff measure $H^n$ such that $\liminf_{r\to0}r^{-n} H^n(B(x,r)\cap E)>0$ for $H^n$-a.e. $x\in E$. In this paper it is shown that $E$ is $n$-rectifiable if and only if…

A positive integer k is a length of a polynomial if that polynomial factors into a product of k irreducible polynomials. We find the set of lengths of polynomials of the form x^n in R[x], where (R, m) is an Artinian local ring with m^2 = 0.

An infinite structure has the finite length property (over a given field) if, for each of its finite powers, chains of equivariant subspaces in the corresponding free vector space are bounded in length. Prior work showed that the countable…

An element of a group is \emph{reversible} if it is conjugate to its own inverse, and it is \emph{strongly reversible} if it is conjugate to its inverse by an involution. A group element is strongly reversible if and only if it can be…

Verifying a conjecture of Petkov{\v{s}}ec, we prove that the lettericity of an n-vertex path is precisely $\left\lfloor \frac{n+4}{3}\right\rfloor$.

We prove that a tournament and its complement contain the same number of oriented Hamiltonian paths (resp. cycles) of any given type, as a generalization of Rosenfeld's result proved for antidirected paths.

We consider the problem of determining the maximum number of moves required to sort a permutation of $[n]$ using cut-and-paste operations, in which a segment is cut out and then pasted into the remaining string, possibly reversed. We give…

We provide an account for the existence and uniqueness of solutions to rough differential equations under the framework of controlled rough paths. The case when the driving path is $\beta$-H\"older continuous, for $\beta>1/3$, is widely…