Related papers: Uniqueness vs non-uniqueness in complete connectio…
Persistence is a strong, global, behavioural property of a Petri net, meaning that no activity can disable a different activity. Persistent permutability is a weaker property, pertaining to individual interleavings of a Petri net and…
We prove a converse Lyapunov theorem for boundedness of reachability sets for a general class of control systems whose flow is Lipschitz continuous on compact intervals with respect to trajectory-dominated inputs. We show that this…
A celebrated result in bifurcation theory is that global connected sets of non-trivial solutions bifurcate from trivial solutions at non-zero eigenvalues of odd algebraic multiplicity of the linearized problem when the operators involved…
Uniqueness quantification ($\exists !$) is a quantifier in first-order logic where one requires that exactly one element exists satisfying a given property. In this paper we investigate the strength of uniqueness quantification when it is…
We present an alternate proof of the passage from the finiteness principle for metric trees to the construction of the core in the C. Fefferman and Shvartsman finiteness theorem for Lipschitz selection problems.
In this paper, we give the explicit bounds for the data of objects involved in some basic theorems of Singularity theory: the Inverse, Implicit and Rank Theorems for Lipschitz mappings, Splitting Lemma and Morse Lemma, the density and…
The classical decision problem, as it is understood today, is the quest for a delineation between the decidable and the undecidable parts of first-order logic based on elegant syntactic criteria. In this paper, we treat the concept of…
Plural (or multiple-conclusion) cuts are inferences made by applying a structural rule introduced by Gentzen for his sequent formulation of classical logic. As singular (single-conclusion) cuts yield trees, which underlie ordinary natural…
Motivated by recent works by Radchenko and Viazovska and by Ramos and Sousa, we find sufficient conditions for a pair of discrete subsets of the real line to be a uniqueness or a non-uniqueness pair for the Fourier transform. These…
It is well-known that Choice and Regularity are independent of each other but have important common consequences of logical character (reflection principles, representations of classes by sets, etc.). We explain this phenomenon by isolating…
This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…
We revisit the classical monotone-follower problem and consider it in a generalized formulation. Our approach is based on a compactness substitute for nondecreasing processes, the Meyer-Zheng weak convergence, and the maximum principle of…
We investigate the similarities between adic finiteness and homological finiteness for chain complexes over a commutative noetherian ring. In particular, we extend the isomorphism properties of certain natural morphisms from homologically…
In a finite volume system, we prove a no-go theorem on a Leibniz rule with a care of locality argument on latttice. The new possibility on the Leibniz rule solutions on lattice is discussed. Although the new solution admits a local…
We study the computational content of the Brouwer Fixed Point Theorem in the Weihrauch lattice. Connected choice is the operation that finds a point in a non-empty connected closed set given by negative information. One of our main results…
We prove the existence of solutions to the Cauchy-Dirichlet problem associated with a class of fully nonlinear anisotropic evolution equations. We prove a comparison principle and conclude the uniqueness of solutions. All results are…
Persistent Laplacians are matrix operators that track how the shape and structure of data transform across scales and are popularly adopted in biology, physics, and machine learning. Their eigenvalues are concise descriptors of geometric…
Motivated by the idea that some characteristics are specific to the relations between individuals and not of the individuals themselves, we study a prototype model for the dynamics of the states of the links in a fixed network of…
Uniqueness and independence are two fundamental properties of data. Their enforcement in database systems can lead to higher quality data, faster data service response time, better data-driven decision making and knowledge discovery from…
The classical Chain Rule formula $(f\circ g)'(x;u)=f'(g(x);g'(x;u))$ gives the (partial, or directional) derivative of the composition of mappings $f$ and $g$. We show how to get rid of the unnecessarily strong assumption of…