Related papers: Non-Numerical Weakly Relational Domains
We consider the nonlinear Poisson-Boltzmann equation in the context of electrostatic models for a biological macromolecule, embedded in a bounded domain containing a solution of an arbitrary number of ionic species which is not necessarily…
Analyzing nodal domains is a way to discern the structure of eigenvectors of operators on a graph. We give a new definition extending the concept of nodal domains to arbitrary signed graphs, and therefore to arbitrary symmetric matrices. We…
We present a framework for constructing strong mixed-integer programming formulations for logical disjunctive constraints. Our approach is a generalization of the logarithmically-sized formulations of Vielma and Nemhauser for SOS2…
We consider the problem of digitalizing Euclidean segments. Specifically, we look for a constructive method to connect any two points in $\mathbb{Z}^d$. The construction must be {\em consistent} (that is, satisfy the natural extension of…
As fragments of first-order logic, Description logics (DLs) do not provide nonmonotonic features such as defeasible inheritance and default rules. Since many applications would benefit from the availability of such features, several…
In many systems consisting of interacting subsystems, the complex interactions between elements can be represented using multilayer networks. However percolation, key to understanding connectivity and robustness, is not trivially…
The compositeness is defined as the weight of the hadronic molecule in the hadron wave function. We can determine the internal structure of the weak-binding system without any specific models from the compositeness. In order to estimate the…
We show that the finite satisfiability problem for the unary negation fragment with arbitrary number of transitive relations is decidable and 2-ExpTime-complete. Our result actually holds for a more general setting in which one can require…
We expand upon work from many hands on the decomposition of nuclear maps. Such maps can be characterized by their ability to be approximately written as the composition of maps to and from matrices. Under certain conditions (such as…
We study Neumann functions for divergence form, second order elliptic systems with bounded measurable coefficients in a bounded Lipschitz domain or a Lipschitz graph domain. We establish existence, uniqueness, and various estimates for the…
In this article we present the first results on domain decomposition methods for nonlocal operators. We present a nonlocal variational formulation for these operators and establish the well-posedness of associated boundary value problems,…
The notions of weak and strong minimizability of a matrix intertwining operator are introduced. Criterion of strong minimizability of a matrix intertwining operator is revealed. Criterion and sufficient condition of existence of a constant…
The main result of this work is as follows: for arbitrary pairwise disjoint finite intervals $(\alpha_j,\beta_j)\subset[0,\infty)$, $j=1,\dots,m$ and for arbitrary $n\geq 2$ we construct the family of periodic non-compact domains…
All the known counterexamples to Kac' famous question "can one hear the shape of a drum", i.e., does isospectrality of two Laplacians on domains imply that the domains are congruent, consist of pairs of domains composed of copies of…
We show explicit formulas for the evaluation of (possibly higher-order) fractional Laplacians of some functions supported on ellipsoids. In particular, we derive the explicit expression of the torsion function and give examples of…
We develop a novel hierarchy for zero-dimensional persistence pairs, i.e., connected components, which is capable of capturing more fine-grained spatial relations between persistence pairs. Our work is motivated by a lack of spatial…
The orthogonal decomposition factorizes a tensor into a sum of an orthogonal list of rankone tensors. We present several properties of orthogonal rank. We find that a subtensor may have a larger orthogonal rank than the whole tensor and…
This paper presents a theory of non-linear integer/real arithmetic and algorithms for reasoning about this theory. The theory can be conceived as an extension of linear integer/real arithmetic with a weakly-axiomatized multiplication…
Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…
Robustness of higher-order networks is often quantified by the instantaneous smallest positive eigenvalue of the Hodge $1$-Laplacian under simplex deletion. We show that this observable is generically ill-defined: along a deletion…