We prove that each coarsely homogenous separable metric space X is coarsely equivalent to one of the spaces: the sigleton, the Cantor macro-cube or the Baire macro-space. This classification is derived from coarse characterizations of the Cantor macro-cube and of the Baire macro-space given in this paper. Namely, we …
The paper proves the existence of infinitely many minimal hypersurfaces in higher-dimensional manifolds.
problem Finding minimal hypersurfaces in higher-dimensional closed manifolds.
method Generic metrics and Baire sense arguments.
result Infinitely many singular minimal hypersurfaces are found in closed manifolds with optimal regularity.
Paper shows certain generalized Whitney topologies are Baire.
problem Understanding the Baire property in generalized Whitney topologies.
method Analyzing intersections of open and dense sets.
result Generalized Whitney topologies are Baire.
For almost all Riemannian metrics (in the C∞ Baire sense) on a closed manifold Mn+1, 3≤(n+1)≤7, we prove that the union of all closed, smooth, embedded minimal hypersurfaces is dense. This implies there are infinitely many minimal hypersurfaces thus proving a conjecture of Yau (1982) for generic …
Minimal surfaces exist for most metrics on compact manifolds with boundary.
problem Existence of minimal surfaces in specific geometric settings.
method Proving existence for almost all Riemannian metrics on compact manifolds with boundary.
result Existence of compact, properly embedded free boundary minimal hypersurfaces for generic metrics.
Generic metrics make geodesic nets dense.
problem Density of geodesic nets under generic metrics.
method Proving density for Baire-generic metrics.
result Union of geodesic nets images is dense.
The paper proves generic transversality and regularity for minimal submanifolds and area-minimizing currents.
problem Transversality and regularity of minimal submanifolds and area-minimizing currents.
method Proves transversality and regularity for generic metrics using Baire category and minimization properties.
result Generic metrics ensure transversality and regularity for minimal submanifolds and area-minimizing currents.
New manifold construction yields Baire-1 functions as cohomotopy groups.
problem Understanding Baire-1 functions on metric spaces.
method Constructing a manifold and analyzing its cohomotopy groups.
result First cohomotopy group of a constructed manifold is the additive group of integer-valued Baire-1 functions.
The Baire metric induces an ultrametric on a dataset and is of linear computational complexity, contrasted with the standard quadratic time agglomerative hierarchical clustering algorithm. We apply the Baire distance to spectrometric and photometric redshifts from the Sloan Digital Sky Survey using, in this work, about…
The Baire metric induces an ultrametric on a dataset and is of linear computational complexity, contrasted with the standard quadratic time agglomerative hierarchical clustering algorithm. In this work we evaluate empirically this new approach to hierarchical clustering. We compare hierarchical clustering based on the …
The paper explores generic properties of minimal surfaces in high dimensions.
problem Understanding the behavior of minimal surfaces in high-dimensional spaces.
method Analyzing the space of conformal minimal immersions using Baire category theory.
result A generic conformal minimal immersion is chaotic in various ways, such as being non-proper, almost proper, and g-complete. Theorem shows generic metrics yield non-degenerate geodesic nets.
problem Characterizing geodesic nets on generic metrics.
method Proving all connected embedded nets are non-degenerate for Baire-generic metrics.
result All stationary geodesic nets are non-degenerate for generic metrics.
Can the Minkowski sum of two compact convex bodies be made smoother by rotating one of them? We construct two infinitely differentiable strictly convex plane bodies such that after any generic rotation (in the Baire category sense) of one of the summands the Minkowski sum is not five times differentiable. On the other …
For almost all Riemannian metrics (in the C∞ Baire sense) on a closed manifold Mn+1, 3≤(n+1)≤7, we prove that there is a sequence of closed, smooth, embedded, connected minimal hypersurfaces that is equidistributed in M. This gives a quantitative version of the main result of \cite{irie-marques…
New criteria for Cantor set tameness and wildness via projections.
problem Characterize dimensions of projections of Cantor sets.
method Geometric measure theory and Baire category theory.
result New criteria for Cantor set tameness and wildness.
All projections of typical Cantor sets in high dimensions are Cantor sets.
problem Whether all projections of a typical Cantor set in high dimensions are Cantor sets.
method Proving that for a dense Gδ subset of Cantor sets, all projections into non-zero linear subspaces are Cantor sets.
result There exists a dense Gδ subset of Cantor sets such that all projections into non-zero linear subspaces are Cantor sets.
We describe many vantage points on the Baire metric and its use in clustering data, or its use in preprocessing and structuring data in order to support search and retrieval operations. In some cases, we proceed directly to clusters and do not directly determine the distances. We show how a hierarchical clustering can …
We show that the topological groups Diff+1(I) and Diff+1(S1) of orientation-preserving C1-diffeomorphisms of the interval and the circle, respectively, admit finitely generated dense subgroups. We also investigate the question of genericity (in the sense of Baire category) of such finite to…
The premier exhibition of the following phenomenon: The fundamental group of any Peano continuum constructed in similar fashion to the Hawaiian earring admits two natural distinct topological group structures. However despite being uncountable and regular, neither group is a Baire space and hence neither group admits a…
The paper proves bounds on the Morse index of free boundary minimal hypersurfaces.
problem Finding bounds on the Morse index of free boundary minimal hypersurfaces.
method Min-max theory applied to (n+1)-dimensional compact manifolds with boundary. result Establishes general upper bounds for the Morse index of free boundary minimal hypersurfaces.
Generic geodesic nets are dense in high-dimensional manifolds.
problem Density of non-closed geodesic nets in high-dimensional manifolds.
method Proving density for a generic metric on a manifold.
result Stationary geodesic nets that are not closed geodesics form a dense set.
We introduce the natural and fairly general notion of a subanalytic bundle (with a finite dimensional vector space P of sections) on a subanalytic subset X of a real analytic manifold M, and prove that when M is compact, there is a Baire subset U of sections in P whose zero-loci in X have tubular neighbou…
Improved Kuznecov remainder estimates for generic metrics.
problem Estimating period integrals of Laplace eigenfunctions on manifolds.
method Two-term asymptotic expansion and elimination of oscillatory second term.
result Improved remainder estimates for Baire-generic metrics.
New proof for weak mixing in polygonal billiards.
problem Proving weak mixing in polygonal billiards.
method Using Baire category and eigenvalue analysis.
result Billiard flow is weakly mixing for non-rational polygons.
In this paper, we study Lipschitz-Fredholm vector fields on Bounded-Fréchet-Finsler manifolds. In this context we generalize the Morse-Sard-Brown theorem, asserting that if M is a connected smooth bounded-Fréchet-Finsler manifold endowed with a strengthened connection K and if ξ is a smooth Lipschitz-Fr…
The study shows that certain metrics on spheres prevent stable tangent cones for area-minimizing boundaries.
problem Preventing stable tangent cones for area-minimizing boundaries under specific metrics.
method Developed a perturbation theorem and used spectral theory and compactness arguments.
result A residual set of metrics on Sn+1 precludes linearly stable tangent cones for area-minimizing boundaries. The paper connects Diophantine approximation to black hole behavior, proving blow-up conditions.
problem Understanding the behavior of waves on Kerr-AdS black holes.
method Analyzing linear scalar perturbations and studying poles of the interior scattering operator.
result Perturbations ψ blow up at the Cauchy horizon under certain non-Diophantine conditions. Classifies geodesic planes outside convex core of geometrically finite 3-manifolds.
problem Classifying geodesic planes in geometrically finite 3-manifolds.
method Constructive proof involving exotic rays and roofs.
result Existence of exotic roofs depends on the existence of exotic rays and bending lamination properties.
A map f:X→Y between topological spaces is defined to be {\em scatteredly continuous} if for each subspace A⊂X the restriction f∣A has a point of continuity. We show that for a function f:X→Y from a perfectly paracompact hereditarily Baire Preiss-Simon space X into a regular space Y the scattere…
A new video prediction model treats videos as continuous processes, reducing sampling steps and improving efficiency.
problem Efficiency and temporal coherence in video prediction models.
method Treats videos as a continuous multi-dimensional process, reducing sampling steps.
result Reduction of 75% sampling steps, state-of-the-art performance on benchmark datasets.
In this partly expository monograph we develop a general framework for producing uncountable families of exotic actions of certain classically studied groups acting on the circle. We show that if L is a nontrivial limit group then the nonlinear representation variety Hom(L,Homeo+(S1)) contains u…
Paper proposes MMD-Sense-Analysis for detecting word sense shifts.
problem Detecting and interpreting shifts in word meanings over time.
method Leverages Maximum Mean Discrepancy (MMD) to identify and explain word sense changes.
result Demonstrates effectiveness of MMD-Sense-Analysis through empirical results.
Mobile sensing is an emerging technology that utilizes agent-participatory data for decision making or state estimation, including multimedia applications. This article investigates the structure of mobile sensing schemes and introduces crowdsourcing methods for mobile sensing. Inspired by social network, one can estab…
New method for sensing non-planar surfaces using ERT.
problem Limited computational techniques for planar surfaces in ERT-based sensing skins.
method Generalized ERT to non-planar surfaces using Riemannian geometry.
result Feasibility and applicability of ERT-based sensing skins for non-planar geometries demonstrated.
Compressed sensing improves MRI scans with data-driven learning.
problem Challenges in applying compressed sensing from research to clinical practice.
method Data-driven learning to address challenges of hand-crafted priors, tuning parameters, and long reconstruction times.
result Compressed sensing can have greater clinical impact with data-driven learning.
This paper proposes a simple adaptive sensing and group testing algorithm for sparse signal recovery. The algorithm, termed Compressive Adaptive Sense and Search (CASS), is shown to be near-optimal in that it succeeds at the lowest possible signal-to-noise-ratio (SNR) levels, improving on previous work in adaptive comp…
Paper tackles online task allocation in multi-attribute social sensing.
problem Optimized task allocation in dynamic, multi-attribute social sensing.
method Quality-Cost-Aware Online Task Allocation (QCO-TA) scheme using online reinforcement learning.
result Significantly outperforms state-of-the-art baselines in sensing accuracy and cost.
DisCor corrects reinforcement learning issues by re-weighting collected data.
problem Reinforcement learning algorithms struggle with instability and sensitivity to hyperparameters.
method DisCor reweights collected data to mitigate issues caused by the distribution of experience.
result DisCor improves reinforcement learning in challenging settings like multi-task learning and noisy reward signals.
Neural story generation gains common sense through targeted training.
problem Lack of common sense reasoning in neural-generated stories.
method Multi-task learning with auxiliary datasets for common sense grounding.
result Improved common sense reasoning and state-of-the-art perplexity.
Study uses remotely sensed data to infer economic outcomes in experiments and quasi-experiments.
problem Imperfect measurement of economic outcomes by remotely sensed variables.
method Combines experimental and observational data to identify causal parameters, using satellite imagery and mobile phone activity.
result Developed a robust method for n^{-1/2} inference that does not restrict remotely sensed variable processing algorithms.
We describe our language-independent unsupervised word sense induction system. This system only uses topic features to cluster different word senses in their global context topic space. Using unlabeled data, this system trains a latent Dirichlet allocation (LDA) topic model then uses it to infer the topics distribution…
Review of image compressive sensing algorithms for beginners.
problem Efficiently processing images with limited data.
method Comprehensive review of Total variation methods and other algorithms.
result Standardized comparison of algorithms for compressive sensing applications.
The paper improves conditions for unique recovery in homomorphic sensing of subspaces.
problem Unique recovery of points in a linear subspace from their images under linear maps.
method Tighter and simpler conditions for unique recovery in single and subspace arrangement cases, extending to noise stability.
result Conditions for unique recovery in homomorphic sensing are improved and unified.
Novel algorithm estimates local permutations in unlabeled multi-view sensing.
problem Estimating local permutations in unlabeled multi-view sensing.
method Graph alignment and Gromov-Wasserstein alignment exploiting multiple views.
result The proposed algorithm is scalable and applicable to challenging SNR regimes.
Paper offers robust recovery for 1-bit sensing with partial Gaussian circulant matrices.
problem Accurately recovering vectors from 1-bit measurements using structured matrices.
method Correlation-based optimization with randomly signed partial Gaussian circulant matrices and generative models.
result Recovery guarantees match those for i.i.d. Gaussian matrices but with faster computation.
Paper improves compressed sensing with prior probability information.
problem Enhancing compressed sensing accuracy with prior information.
method Designing a sensing matrix and sparse recovery algorithm using probability-based prior information.
result Proposed methods outperform existing CS systems in simulations.
Study evaluates progress in common-sense reasoning tasks.
problem Assessing genuine progress in common-sense reasoning systems.
method Case studies of WSC and SWAG, protocol design to clarify results.
result Previous experimental designs had flaws, need for new protocols.
CNN model for efficient wireless spectrum sensing and signal identification.
problem Efficient utilization of scarce wireless spectrum.
method Convolutional Neural Network (CNN) based on spectral correlation function.
result Significant performance gains over existing methods.