Related papers: Some aspects of calculus on non-smooth sets
According to [1] an $n$-dimensional $\mathcal{N}$--set is a compact subset $A$ of $\mathbb{R}^n$ such that for every $x$ in $\mathbb{R}^n$ there is $y$ in $A$ with $y-x$ in $\mathbb{Z}^n$. We prove that every two dimensional…
In this paper we present a new theory of calculus over $k$-dimensional domains in a smooth $n$-manifold, unifying the discrete, exterior, and continuum theories. The calculus begins at a single point and is extended to chains of finitely…
A finite subset $X$ of the Euclidean space is called an $m$-distance set if the number of distances between two distinct points in $X$ is equal to $m$. An $m$-distance set $X$ is said to be maximal if any vector cannot be added to $X$ while…
Deciding whether a family of disjoint line segments in the plane can be linked into a simple polygon (or a simple polygonal chain) by adding segments between their endpoints is NP-hard.
If and only if each point of a set of the phase-space is in the topological hull of a trajectory running through any other point of this set, we call this set a quasiergodic set. But which are these so defined quasiergodic sets in the case…
Euclidean quantum measure in Regge calculus with independent area tensors is considered using example of the Regge manifold of a simple structure. We go over to integrations along certain contours in the hyperplane of complex connection…
Integer iteration rules such as n |-> {a n + b, c n +d} are studied as minimal examples of the general process of multicomputation. Despite the simplicity of such rules, their multiway graphs can be complex, exhibiting, for example,…
In this paper, we construct a compact subset of the real plane whose path-connectedness equivalence relation is Borel bireducible to a nonsmooth hyperfinite Borel equivalence relation. This answers a question of \cite{bec98}.
In this paper we study a path-following problem on $R^3$ with a non-holonomic constraint. The geometric structure associated to the velocity constraint is explored, and general principles for constructing guiding vector fields are obtained,…
For a finite set $S$ of points in the plane and a graph with vertices on $S$ consider the disks with diameters induced by the edges. We show that for any odd set $S$ there exists a Hamiltonian cycle for which these disks share a point, and…
Various authors have calculated how many pairwise incomparable points can be selected from a partially ordered set. We tackle this question for the family of subsets of a finite set obtained by removing or adding a bounded number of…
Enlarging on Parts I and II we write more equations in the desired format of the extended abstract theory of composites. We focus on a multitude of full dynamic equations, including equations where the medium is moving or otherwise changing…
Connectedness, path connectedness, and uniform connectedness are well-known concepts. In the traditional presentation of these concepts there is a substantial difference between connectedness and the other two notions, namely connectedness…
Graphs are used in almost every scientific discipline to express relations among a set of objects. Algorithms that compare graphs, and output a closeness score, or a correspondence among their nodes, are thus extremely important. Despite…
Minimizing the Euclidean distance to a set arises frequently in applications. When the set is algebraic, a measure of complexity of this optimization problem is its number of critical points. In this paper we provide a general framework to…
Many concrete problems are formulated in terms of a finite set of points in $R^n$ which, via the ambient Euclidean metric, becomes a finite metric space. To obtain information from such a space, it is often useful to associate a graph to…
A convex subset X of a linear topological space is called compactly convex if there is a continuous compact-valued map $\Phi:X\to exp(X)$ such that $[x,y]\subset\Phi(x)\cup \Phi(y)$ for all $x,y\in X$. We prove that each convex subset of…
Studying the geometry of sets appearing in various problems of quantum information helps in understanding different parts of the theory. It is thus worthwhile to approach quantum mechanics from the angle of geometry -- this has already…
We consider the variational complex on infinite jet space and the complex of variational derivatives for Lagrangians of multidimensional paths and study relations between them. The discussion of the variational (bi)complex is set up in…
We introduce the abstract notion of a chain, which is a sequence of $n$ points in the plane, ordered by $x$-coordinates, so that the edge between any two consecutive points is unavoidable as far as triangulations are concerned. A general…