Related papers: On unique determination of polyhedral sets
In this Phd. thesis, a structural analysis of construction schemes is developed. The importance of this study will be justified by constructing several distinct combinatorial objects which have been of great interest in mathematics. We then…
In this work, we present a result on the local existence and uniqueness of solutions to nonlinear Partial Differential-Algebraic Equations (PDAEs). By applying established theoretical results, we identify the conditions that guarantee the…
The difference variational bicomplex, which is the natural setting for systems of difference equations, is constructed and used to examine the geometric and algebraic properties of various systems. Exactness of the bicomplex gives a…
Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…
We quantify the uniqueness of continuation from Cauchy or interior data. Our approach consists in extending the existing results in the linear case. As by product we obtain a new stability estimate in the linear case. We also show the…
We establish sufficient conditions for finite convergence of the alternating projections method for two non-intersecting and potentially nonconvex sets. Our results are based on a generalization of the concept of intrinsic transversality,…
We prove a unified and general criterion for the uniqueness of critical points of a functional in the presence of constraints such as positivity, boundedness, or fixed mass. Our method relies on convexity properties along suitable paths and…
We give a self-contained treatment of the theory of persistence modules indexed over the real line. We give new proofs of the standard results. Persistence diagrams are constructed using measure theory. Linear algebra lemmas are simplified…
We give a combinatorial characterization of generic frameworks that are minimally rigid under the additional constraint of maintaining symmetry with respect to a finite order rotation or a reflection. To establish these results we develop a…
Persistent homology is a popular and useful tool for analysing finite metric spaces, revealing features that can be used to distinguish sets of unlabeled points and as input into machine learning pipelines. The famous stability theorem of…
Recent results of several authors have led to constructions of parallelotopes which are bounded remainder sets for totally irrational toral rotations. In this brief note we explain, in retrospect, how some of these results can easily be…
This is the first of a series of papers in which we initiate and develop the theory of reflection monoids, motivated by the theory of reflection groups. The main results identify a number of important inverse semigroups as reflection…
We propose a novel polyhedral uncertainty set for robust optimization, termed the smooth uncertainty set, which captures dependencies of uncertain parameters by constraining their pairwise differences. The bounds on these differences may be…
It is proved that a general polyhedral perfect conducting obstacle in $\mathbb{R}^3$, possibly consisting of finitely many solid polyhedra, is uniquely determined by the far-field pattern corresponding to a single incident wave. This…
The purpose of this paper is to prove that every finite set of points that can be constructed in the Euclidean plane by using a compass and a ruler can also be constructed by using unitary match-sticks in a non-simultaneous way and…
This paper mainly focuses on cones whose basis is a maximum $h$-scattered linear set. We start by investigating the intersection sizes of such cones with the hyperplanes. Then we analyze two constructions of point sets with few intersection…
In this paper, isometric embedding results of Greene, Gromov and Rokhlin are extended to what are called "indefinite metric polyhedra". Two definitions for an indefinite metric polyhedron are given, an intuitive definition and a more useful…
We conjecture that a convex polytope is uniquely determined up to isometry by its edge-graph, edge lengths and the collection of distances of its vertices to some arbitrary interior point, across all dimensions and all combinatorial types.…
In this paper, we continue the study of linear sets with complementary weights. We find criteria to determine the set of points of any fixed weight and use this to present particular linear sets with few points of weight more than one. We…
The first part of this article deals with theorems on uniqueness in law for \sigma-finite and constructive countable random sets, which in contrast to the usual assumptions may have points of accumulation. We discuss and compare two…