Related papers: Leaf superposition property for integer rectifiabl…
We prove several results on Almgren's multiple valued functions and their links to integral currents. In particular, we give a simple proof of the fact that a Lipschitz multiple valued map naturally defines an integer rectifiable current;…
We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…
We study some fundamental properties of real rectifiable currents and give a generalization of King's theorem in characterizing currents defined by positive real holomorphic chains. Our proof uses Siu's semicontinuity theorem and largely…
A graph is regularizable if it is possible to assign weights to its edges so that all nodes have the same degree. Weights can be positive, nonnegative or arbitrary as soon as the regularization degree is not null. Positive and nonnegative…
Many graph coloring proofs proceed by showing that a minimal counterexample to the theorem being proved cannot contain certain configurations, and then showing that each graph under consideration contains at least one such configuration;…
We introduce the metric fundamental class for metric spaces that are homeomorphic to compact, non-orientable, smooth manifolds with (possibly empty) boundary. This is an integer rectifiable current that provides an analytic representation…
For nice functions, invariant means over integral currents (certain generalized surfaces), can be uniquely defined.
We prove that if the prime graphs in a graph class have bounded lettericity, then the entire class has bounded lettericity if and only if it does not contain arbitrary large matchings, co-matchings, or a family of graphs that we call…
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
So far, a very large amount of work in Natural Language Processing (NLP) rely on trees as the core mathematical structure to represent linguistic informations (e.g. in Chomsky's work). However, some linguistic phenomena do not cope properly…
We introduce the formalism of positive super currents on \mathbb{R}^{n}, in strong analogy with the theory of positive currents in \mathbb{C}^{n}. We consider intersection of currents and Lelong numbers, and as an application we show that…
Continuous-time Markov chains have been successful in modelling systems across numerous fields, with currents being fundamental entities that describe the flows of energy, particles, individuals, chemical species, information, or other…
We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…
In this paper, we construct various examples of holomorphic laminations, with leaves of dimension 1, and we also study some of their dynamical properties. In particular we study existence and uniqueness of positive closed currents. We…
In the setting of complete metric spaces, we prove that integral currents can be decomposed as a sum of indecomposable components. In the special case of one-dimensional integral currents, we also show that the indecomposable ones are…
Under what circumstances might every extension of a combinatorial structure contain more copies of another one than the original did? This property, which we call prolificity, holds universally in some cases (e.g., finite linear orders) and…
We introduce a linearized version of group field theory. It can be viewed either as a group field theory over the additive group of a vector space or as an asymptotic expansion of any group field theory around the unit group element. We…
It is shown that a graph parameter can be realized as the number of homomorphisms into a fixed (weighted) graph if and only if it satisfies two linear algebraic conditions: reflection positivity and exponential rank-connectivity. In terms…
For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings.…
We consider random arrays indexed by the leaves of an infinitary rooted tree of finite depth, with the distribution invariant under the rearrangements that preserve the tree structure. We call such arrays hierarchically exchangeable and…