Related papers: On unique determination of polyhedral sets
The scattering of waves by obstacles in a 2D setting is considered, in particular the computation of the scattered field via the collocation or the least-squares methods. In the case of multiple scattering by smooth obstacles, we prove that…
A beautiful result of Br\"ocker and Scheiderer on the stability index of basic closed semi-algebraic sets implies, as a very special case, that every $d$-dimensional polyhedron admits a representation as the set of solutions of at most…
We describe the adjacency of vertices of the (unbounded version of the) set covering polyhedron, in a similar way to the description given by Chvatal for the stable set polytope. We find a sufficient condition for adjacency, and…
In this paper we adopt a geometric point of view regarding a famous conjecture due to Littlewood in diophantine approximation of real numbers. Following the spirit of the geometric theory of continued fractions, we give a sufficient…
A rigorous geometric proof of the Lie's Theorem on nonlinear superposition rules for solutions of non-autonomous ordinary differential equations is given filling in all the gaps present in the existing literature. The proof is based on an…
A group is coherent if all its finitely generated subgroups are finitely presented. In this article we provide a criterion for positively determining the coherence of a group. This criterion is based upon the notion of the perimeter of a…
We study the modular representation theory of the symmetric and alternating groups. One of the most natural ways to label the irreducible representations of a given group or algebra in the modular case is to show the unitriangularity of the…
This paper reproduces the text of a part of the Author's DPhil thesis. It gives a proof of the classification of non-trivial, finite homogeneous geometries of sufficiently high dimension which does not depend on the classification of the…
This paper explores recent progress related to constraint maps. Building on the exposition in [14], our goal is to provide a clear and accessible account of some of the more intricate arguments behind the main results in this work. Along…
There are two well known tasks, related to Newton polyhedra: to study invariants of singularities in terms of their Newton polyhedra, and to describe Newton polyhedra of resultants and discriminants. We introduce so called resultantal…
We formalize and study the natural approach of designing convex surrogate loss functions via embeddings, for problems such as classification, ranking, or structured prediction. In this approach, one embeds each of the finitely many…
We study discrete Lorentzian spectral geometry by investigating to what extent causal sets can be identified through a set of geometric invariants such as spectra. We build on previous work where it was shown that the spectra of certain…
We provide fine asymptotics of solutions of fractional elliptic equations at boundary points where the domain is locally conical; that is, corner type singularities appear. Our method relies on a suitable smoothing of the corner singularity…
Disordered packings of colloidal spheres show angle-independent structural color when the particles are on the scale of the wavelength of visible light. Previous work has shown that the positions of the peaks in the reflectance spectra can…
For the scattering system given by the Laplacian in a half-space with a periodic boundary condition, we derive resolvent expansions at embedded thresholds, we prove the continuity of the scattering matrix, and we establish new formulas for…
In this work, we will explore some polygons that individually are capable of filling the plane in an aperiodic way. These polygons were recently discovered by some researchers and constitute a great discovery for Mathematics. We will…
Under a mild Lipschitz condition we prove a theorem on the existence and uniqueness of global solutions to delay fractional differential equations. Then, we establish a result on the exponential boundedness for these solutions.
Given an initial family of sets, we may take unions, intersections and complements of the sets contained in this family in order to form a new collection of sets; our construction process is done recursively until we obtain the last family.…
The reflection principle is the statement that if a sentence is provable then it is true. Reflection principles have been studied for first-order theories, but they also play an important role in propositional proof complexity. In this…
We consider three uniqueness theorems: one from the theory of meromorphic functions, another one from asymptotic combinatorics, and the third one about representations of the infinite symmetric group. The first theorem establishes the…