Searcharxiv⌕ Search

arXiv subjects

Andrea Marchese

Publications and source records attributed to Andrea Marchese.

42 records · Page 3Linked to original sources

Improved estimate of the singular set of Dir-minimizing Q-valued functions via an abstract regularity result

In this note we prove an abstract version of a recent quantitative stratifcation priciple introduced by Cheeger and Naber (Invent. Math., 191 (2013), no. 2, 321-339; Comm. Pure Appl. Math., 66 (2013), no. 6, 965-990). Using this general regularity result paired with an $\varepsilon$-regularity theorem we provide a new estimate of the Minkowski dimension of the set of higher multiplicity points of a Dir-minimizing Q-valued function. The abstract priciple is applicable to several other problems: we recover recent results in the literature and we obtain also some improvements in more classical contexts.

math.AP↗

The Steiner tree problem revisited through rectifiable G-currents

The Steiner tree problem can be stated in terms of finding a connected set of minimal length containing a given set of finitely many points. We show how to formulate it as a mass-minimization problem for $1$-dimensional currents with coefficients in a suitable normed group. The representation used for these currents allows to state a calibration principle for this problem. We also exhibit calibrations in some examples.

math.OC↗

On the building dimension of closed cones and Almgren's stratification principle

In this paper we disprove a conjecture stated in [4] on the equality of two notions of dimension for closed cones. Moreover, we answer in the negative to the following question, raised in the same paper. Given a compact family $\mathcal{C}$ of closed cones and a set $S$ such that every blow-up of $S$ at every point $x\in S$ is contained in some element of $\mathcal{C}$, is it true that the dimension of $S$ is smaller than or equal to the largest dimension of a vector space contained is some element of $\mathcal{C}$?

math.OC↗

An optimal irrigation network with infinitely many branching points

The Gilbert-Steiner problem is a mass transportation problem, where the cost of the transportation depends on the network used to move the mass and it is proportional to a certain power of the "flow". In this paper, we introduce a new formulation of the problem, which turns it into the minimization of a convex functional in a class of currents with coefficients in a group. This framework allows us to define calibrations, which can be used to prove the optimality of concrete configurations. We apply this technique to prove the optimality of a certain irrigation network, having the topological property mentioned in the title.

math.OC↗

On a question by Corson about point-finite coverings

We answer in the affirmative the following question raised by H. H. Corson in 1961: "Is it possible to cover every Banach space X by bounded convex sets with nonempty interior in such a way that no point of X belongs to infinitely many of them?" Actually we show the way to produce in every Banach space X a bounded convex tiling of order 2, i.e. a covering of X by bounded convex closed sets with nonempty interior (tiles) such that the interiors are pairwise disjoint and no point of X belongs to more than two tiles.

math.FA↗