English
Related papers

Related papers: Plateau's Problem: What's Next

200 papers

This paper continues the previous studies in two papers of Huang-Yin [HY3-4] on the flattening problem of a CR singular point of real codimension two sitting in a submanifold in ${\mathbb C}^{n+1}$ with $n+1\ge 3$, whose CR points are…

Complex Variables · Mathematics 2017-03-28 Hanlong Fang , Xiaojun Huang

Methodology is provided towards the solution of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the d-dimensional Euclidean…

Computational Geometry · Computer Science 2024-10-16 Michael N. Vrahatis

This work is concerned with the equation $ \partial_t \rho = \Delta_x \rho^m $, $ m > 1 $, known as the porous medium equation. It shows stability of the pressure of solutions close to flat travelling wave fronts in the homogeneous…

Analysis of PDEs · Mathematics 2015-03-03 Clemens Kienzler

We investigate general semilinear (obstacle-like) problems of the form $\Delta u = f(u)$, where $f(u)$ has a singularity/jump at $\{u=0\}$ giving rise to a free boundary. Unlike many works on such equations where $f$ is approximately…

Analysis of PDEs · Mathematics 2025-05-09 Mark Allen , Dennis Kriventsov , Henrik Shahgholian

A critically challenging problem facing statisticians is the identification of a suitable framework which consolidates data of various types, from different sources, and across different time frames or scales (many of which can be missing),…

Applications · Statistics 2012-03-02 Karen Kafadar

The compactness phenomenon is one of the featured aspects of structuralism in mathematics. In simple and broad words, a compactness property holds in a structure if a related property is satisfied by sufficiently many substructures of that…

Logic · Mathematics 2024-08-29 Rahman Mohammadpour

In 2022, Olivier Longuet, a French mathematics teacher, created a game called the \textit{calissons puzzle}. Given a triangular grid in a hexagon and some given edges of the grid, the problem is to find a calisson tiling such that no input…

Computational Geometry · Computer Science 2023-07-06 Jean-Marie Favreau , Yan Gerard , Pascal Lafourcade , Léo Robert

Formalization of mathematics is a major topic, that includes in particular numerical analysis, towards proofs of scientific computing programs. The present study is about the finite element method, a popular method to numerically solve…

Logic in Computer Science · Computer Science 2026-04-23 Sylvie Boldo , François Clément , Vincent Martin , Micaela Mayero , Houda Mouhcine

We define the parametric closure problem, in which the input is a partially ordered set whose elements have linearly varying weights and the goal is to compute the sequence of minimum-weight lower sets of the partial order as the weights…

Data Structures and Algorithms · Computer Science 2018-01-18 David Eppstein

For most optimisation methods an essential assumption is the vector space structure of the feasible set. This condition is not fulfilled if we consider optimisation problems over the sphere. We present an algorithm for solving a special…

Computation · Statistics 2018-02-27 Gabriele Eichfelder , Thomas Hotz , Johannes Wieditz

In this survey we present the history and recent progress on several fundamental (quasi)conformal uniformization problems in the complex plane. Uniformization refers to the process of mapping a space to a canonical model by means of a…

Complex Variables · Mathematics 2026-03-17 Dimitrios Ntalampekos

An important problem in analytic and geometric combinatorics is estimating the number of lattice points in a compact convex set in a Euclidean space. Such estimates have numerous applications throughout mathematics. In this note, we exhibit…

Number Theory · Mathematics 2013-08-19 Lenny Fukshansky , Glenn Henshaw

We present a differential algebra of generalized functions over a field of generalized scalars by means of several axioms in terms of general algebra and topology. Our differential algebra is of Colombeau type in the sense that it contains…

Functional Analysis · Mathematics 2014-05-29 Todor D. Todorov

A covering problem posed by Henri Lebesgue in 1914 seeks to find the convex shape of smallest area that contains a subset congruent to any point set of unit diameter in the Euclidean plane. Methods used previously to construct such a…

Metric Geometry · Mathematics 2018-10-25 Philip Gibbs

Factorization algebras are local-to-global objects living on manifolds, and they arise naturally in mathematics and physics. Their local structure encompasses examples like associative algebras and vertex algebras; in these examples, their…

Mathematical Physics · Physics 2023-10-30 Kevin Costello , Owen Gwilliam

Let $\mathcal{T}$ be a set of $n$ flat (planar) semi-algebraic regions in $\mathbb{R}^3$ of constant complexity (e.g., triangles, disks), which we call plates. We wish to preprocess $\mathcal{T}$ into a data structure so that for a query…

Computational Geometry · Computer Science 2025-03-18 Pankaj K. Agarwal , Boris Aronov , Esther Ezra , Matthew J. Katz , Micha Sharir

Clustering large spatial databases is an important problem, which tries to find the densely populated regions in a spatial area to be used in data mining, knowledge discovery, or efficient information retrieval. However most algorithms have…

Databases · Computer Science 2009-09-25 Mohamed A. El-Zawawy , Mohamed E. El-Sharkawi

We study the Cauchy problem associated with the equations governing a fluid loaded plate formulated on either the line or the half-line. We show that in both cases the problem can be solved by employing the unified approach to boundary…

Analysis of PDEs · Mathematics 2015-05-13 Anthony C. L Ashton , A. S. Fokas

We prove optimal regularity and a detailed analysis of the free boundary of the solutions to the thin obstacle problem for nonparametric minimal surfaces with flat obstacles.

Analysis of PDEs · Mathematics 2020-03-23 Matteo Focardi , Emanuele Spadaro

The Satisfactory Partition problem consists in deciding if the set of vertices of a given undirected graph can be partitioned into two nonempty parts such that each vertex has at least as many neighbours in its part as in the other part.…

Data Structures and Algorithms · Computer Science 2020-07-29 Ajinkya Gaikwad , Soumen Maity , Shuvam Kant Tripathi