相关论文: Ham-Sandwich cuts and center transversals in subsp…
We develop a general theory to address a consensus-based combination of estimations in a parallelized or distributed estimation setting. Taking into account the possibility of very discrepant estimations, instead of a full consensus we…
Given a smooth distribution $\mathscr{D}$ of $m$-dimensional planes along a smooth regular curve $\gamma$ in $\mathbb{R}^{m+n}$, we consider the following problem: to find an $m$-dimensional rank-one submanifold of $\mathbb{R}^{m+n}$, that…
We consider the continuous $W^{2,d}$ immersions of $d$-dimensional hypersurfaces in $\mathbb{R}^{d+1}$ with second fundamental forms uniformly bounded in $L^d$. Two results are obtained: first, a family of such immersions is constructed,…
A new geometrically exact micro-structured model is constructed using a generalisation of the notion of Riemann-Cartan manifolds and fibre bundle theory of rank 3. This model is based around the concept of two different length scales: a…
We re-examine the problem of gauging the Wess-Zumino term of a d-dimensional bosonic sigma-model. We phrase this problem in terms of the equivariant cohomology of the target space and this allows for the homological analysis of the…
We characterize embedded $\C^1$ hypersurfaces of $\R^n$ as the only locally closed sets with continuously varying flat tangent cones whose measure-theoretic-multiplicity is at most $m<3/2$. It follows then that any (topological)…
Many results in mass partitions are proved by lifting $\mathbb{R}^d$ to a higher-dimensional space and dividing the higher-dimensional space into pieces. We extend such methods to use lifting arguments to polyhedral surfaces. Among other…
We study the packing dimension of unions of subsets of $k$-planes in $\mathbb{R}^n$ using tools from algorithmic information theory, obtaining an analog of a result of H\'era and a mild generalization of a recent result of Fraser. Along the…
Motivated by quite recent research involving the relationship between the dimension of a poset and graph-theoretic properties of its cover graph, we show that for every $d\geq 1$, if $P$ is a poset and the dimension of a subposet $B$ of $P$…
The counting and (upper) mass dimensions are notions of dimension for subsets of $\mathbb{Z}^d$. We develop their basic properties and give a characterization of the counting dimension via coverings. In addition, we prove Marstrand-type…
We introduce a randomized iterative fragmentation procedure for finite metric spaces, which is guaranteed to result in a polynomially large subset that is $D$-equivalent to an ultrametric, where $D\in (2,\infty)$ is a prescribed target…
We consider a geometric combinatorial problem naturally associated to the geometric topology of certain spherical space forms. Given a collection of $m$ mass distributions on $\mathbb{R}^n$, the existence of $k$ affinely independent regular…
The past few years have seen a revived interest in quantum geometrical characterizations of band structures due to the rapid development of topological insulators and semi-metals. Although the metric tensor has been connected to many…
We prove several reflection theorems on $D$-spaces, which are Hausdorff topological spaces $X$ in which for every open neighbourhood assignment $U$ there is a closed discrete subspace $D$ such that \[ \bigcup\{U(x): x\in D\}=X. \] The…
We prove several reflection theorems on $D$-spaces, which are Hausdorff topological spaces $X$ in which for every open neighbourhood assignment $U$ there is a closed discrete subspace $D$ such that \[ \bigcup\{U(x): x\in D\}=X. \] The…
We investigate the statistical properties of cut sizes generated by heuristic algorithms which solve approximately the graph bisection problem. On an ensemble of sparse random graphs, we find empirically that the distribution of the cut…
We propose a generalized version of the bisection method where the cutting point between the two subintervals is chosen at random following an arbitrary distribution. We compute expected convergence rates with respect to any arbitrary a…
A loose Hamilton cycle in a hypergraph is a cyclic sequence of edges covering all vertices in which only every two consecutive edges intersect and do so in exactly one vertex. With Dirac's theorem in mind, it is natural to ask what minimum…
In the context of studying string backgrounds, much work has been devoted to the question of how similar a general quantum field theory (specifically, a two-dimensional superconformal theory) is to a sigma model. Put differently, one would…
We prove that the set of directions of lines intersecting three disjoint balls in $R^3$ in a given order is a strictly convex subset of $S^2$. We then generalize this result to $n$ disjoint balls in $R^d$. As a consequence, we can improve…