Related papers: Topics in Boolean Representable Simplicial Complex…
Simplicial complexes are increasingly used to understand the topology of complex systems as different as brain networks and social interactions. It is therefore of special interest to extend the study of percolation to simplicial complexes.…
We study the complexity of satisfiability problems in probabilistic and causal reasoning. Given random variables $X_1, X_2,\ldots$ over finite domains, the basic terms are probabilities of propositional formulas over atomic events $X_i =…
The requirement for identifying accurate system representations has not only been a challenge to fulfill, but it has compromised the scalability of formal methods, as the resulting models are often too complex for effective decision making…
We study the parametrizations of simple modules provided by the theory of basic sets for all finite Weyl groups. In the case of type B, we show the existence of basic sets for the matrices of constructible representations. Then we study…
An overview of computational methods to describe high-dimensional potential energy surfaces suitable for atomistic simulations is given. Particular emphasis is put on accuracy, computability, transferability and extensibility of the methods…
Recent work has shown that the input-output behavior of some machine learning systems can be captured symbolically using Boolean expressions or tractable Boolean circuits, which facilitates reasoning about the behavior of these systems.…
We simplify some crucial calculations in \cite{1} by using the technique of spectral sequence of a double complex.
The derivatives of a Boolean function are defined up to any order. The Taylor and MacLaurin expansions of a Boolean function are thus obtained. The last corresponds to the ring sum expansion (RSE) of a Boolean function, and is a more…
We study Toeplitz operators with separately radial and radial symbols on the weighted Bergman spaces on the unit ball. The unitary equivalence of such operators with multiplication operators on $\ell^2$ spaces was previously obtained by…
Asking which sets are fixed-parameter tractable for a given parameterization constitutes much of the current research in parameterized complexity theory. This approach faces some of the core difficulties in complexity theory. By focussing…
We consider a class of \textit{factorizable} Poisson brackets which includes almost all reasonable Poisson structures. A particular case of the factorizable brackets are those associated with symplectic Lie algebroids. The BRST theory is…
The algebraic structure and the spectral properties of a special class of multi-component NLS equations, related to the symmetric spaces of {\bf BD.I}-type are analyzed. The focus of the study is on the spectral theory of the relevant Lax…
The correlation matrices or tensors in the Bloch representation of density matrices are encoded with entanglement properties. In this paper, based on the Bloch representation of density matrices, we give some new separability criteria for…
Representations of Boolean functions by real polynomials play an important role in complexity theory. Typically, one is interested in the least degree of a polynomial p(x_1,...,x_n) that approximates or sign-represents a given Boolean…
The satisfiability problem for multilevel syllogistic extended with the Cartesian product operator (MLSC) is a long-standing open problem in computable set theory. For long, it was not excluded that such a problem were undecidable, due to…
We focus on computing certified upper bounds for the positive maximal singular value (PMSV) of a given matrix. The PMSV problem boils down to maximizing a quadratic polynomial on the intersection of the unit sphere and the nonnegative…
The relativistic two-body problem is considered for spinless particles subject to an external macroscopic electromagnetic field. When this field is made of the monochromatic superposition of two counter-propagating plane waves (and provided…
Shapley values, originating in game theory and increasingly prominent in explainable AI, have been proposed to assess the contribution of facts in query answering over databases, along with other similar power indices such as Banzhaf…
We develop the representation theory of a finite semigroup over an arbitrary commutative semiring with unit, in particular classifying the irreducible and minimal representations. The results for an arbitrary semiring are as good as the…
By using the theory of Complex Multiplication for general Siegel modular varieties we construct arithmetic subalgebras for BC-type systems attached to number fields containing a CM field. Our approach extends the construction of Connes,…