Related papers: Leaf superposition property for integer rectifiabl…
On one hand, we study the class of graphs on surfaces, satisfying tessellation properties, with positive Forman curvature on each edge. Via medial graphs, we provide a new proof for the finiteness of the class, and give a complete…
It is well known that each nonnegative integral flow on a graph can be decomposed into a sum of nonnegative graphic circuit flows, which cannot be further decomposed into nonnegative integral sub-flows. This is equivalent to saying that the…
We show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first charac- terize some functions having linear translators, based on which several families of…
The Divisibility Graph of a finite group $G$ has vertex set the set of conjugacy class lengths of non-central elements in $G$ and two vertices are connected by an edge if one divides the other. We determine the connected components of the…
In this paper we study integer multiplicity rectifiable currents carried by the subgradient (subdifferential) graphs of semi-convex functions on a $n$-dimensional convex domain, and show a weak continuity theorem with respect to pointwise…
We present some results concerning currents of integration on finite-dimensional analytic spaces in Hilbert spaces, using the setting of metric currents. In particular, we obtain the characterization of such currents as positive closed…
In an alternating-current network, each edge has a complex "conductance" with positive real part. The response map is the linear map from the vector of voltages at a subset of "boundary nodes" to the vector of currents flowing into the…
We study a family of positive weighted well-covered graphs, which we call levelable graphs, that are related to a construction of level artinian rings in commutative algebra. A graph $G$ is levelable if there exists a weight function with…
A rigorous geometric proof of the Lie's Theorem on nonlinear superposition rules for solutions of non-autonomous ordinary differential equations is given filling in all the gaps present in the existing literature. The proof is based on an…
We obtain the rectifiability of the graph of a bounded variation homeomorphism $f$ in the plane and relations between gradients of $f$ and its inverse. Further, we show an example of a bounded variation homeomorphism $f$ in the plane which…
Call a percolation process on edges of a graph change intolerant if the status of each edge is almost surely determined by the status of the other edges. We give necessary and sufficient conditions for change intolerance of the wired…
Multi-photon and coherent states of light are formulated in terms of a reducible representation of canonical commutation relations. Standard properties of such states are recovered as certain limiting cases. The new formalism leads to field…
It is proved that any (repetitive) Riemannian manifold of bounded geometry can be realized as a leaf of some (minimal) Riemannian matchbox manifold without holonomy. Our methods can be adapted to achieve Cantor transversals or a prescribed…
We consider fibrations by affine lines on smooth affine surfaces obtained as complements of smooth rational curves $B$ in smooth projective surfaces $X$ defined over an algebraically closed field of characteristic zero. We observe that…
In this paper we examine a number of term rewriting system for integer number representations, building further upon the datatype defining systems described in [2]. In particular, we look at automated methods for proving confluence and…
This paper presents sufficient graph-theoretic conditions for injectivity of collections of differentiable functions on rectangular subsets of R^n. The results have implications for the possibility of multiple fixed points of maps and…
If an infinite non-periodic word is uniformly recurrent or is of bounded repetition, then the limit of its periodicity complexity is infinity. Moreover, there are uniformly recurrent words with the periodicity complexity arbitrarily high at…
We develop a comprehensive string diagrammatic treatment of electrical circuits. Building on previous, limited case studies, we introduce controlled sources and meters as elements, and the impedance calculus, a powerful toolbox for…
A rigorous mathematical proof is given of a class of vector identities that provide a way to separate an arbitrary vector field (over a linear space) into the sum of a radial (i.e., pointing toward the radial unit vector) vector field,…
Data vectors generalise finite multisets: they are finitely supported functions into a commutative monoid. We study the question if a given data vector can be expressed as a finite sum of others, only assuming that 1) the domain is…