Related papers: A Tenth Hilbert Problem-like Result: The Decidabil…
The classification of separable operator spaces and systems is commonly believed to be intractable. We analyze this belief from the point of view of Borel complexity theory. On one hand we confirm that the classification problems for…
A simplified direct method is described for obtaining massless scalar functional determinants on the Euclidean ball. The case of odd dimensions is explicitly discussed.
We investigate the matched product of solutions associated with right and left shelves. First, we prove that the requirements to provide the matched product of solutions that come from shelves can be simplified. Then we give conditions for…
In this paper, we study the product of orders of composition factors of odd order in a composition series of a finite linear group. First we generalize a result by Manz and Wolf about the order of solvable linear groups of odd order. Then…
This paper deals with the problem of measurable lifting modification for stochastic processes in its most general form and with the 'product lifting problem'. Solutions to the positive are reduced to the existence of marginals with respect…
We study infinite products of reproducing kernels with view to their use in dynamics (of iterated function systems), in harmonic analysis, and in stochastic processes. On the way, we construct a new family of representations of the Cuntz…
Hilbert's Tenth Problem over the field $\mathbb Q$ of rational numbers is one of the biggest open problems in the area of undecidability in number theory. In this paper we construct new, computably presentable subrings $R$ of $\mathbb Q$…
Let $R$ be a commutative unital ring. A well-known factorization problem is whether any matrix in $\mathrm{SL}_n(R)$ is a product of elementary matrices with entries in $R$. To solve the problem, we use two approaches based on the notion of…
We obtain several rigidity results regarding tensor product decompositions of factors. First, we show that any full factor with separable predual has at most countably many tensor product decompositions up to stable unitary conjugacy. We…
In this work, we focus on the set-theoretical solutions of the Yang-Baxter equation which are of finite order and not necessarily bijective. We use the matched product of solutions as a unifying tool for treating these solutions of finite…
Decisions are often based on imprecise, uncertain or vague information. Likewise, the consequences of an action are often equally unpredictable, thus putting the decision maker into a twofold jeopardy. Assuming that the effects of an action…
We prove a negative solution to the analogue of Hilbert's tenth problem for rings of one variable non-Archimedean entire functions in any characteristic. In the positive characteristic case we prove more: the ring of rational integers is…
This short paper proposes to learn models of satisfiability modulo theories (SMT) formulas during solving. Specifically, we focus on infinite models for problems in the logic of linear arithmetic with uninterpreted functions (UFLIA). The…
Slater determinants are product states of filled quantum fermionic orbitals. When they are expressed in a configuration space basis chosen a priori, their entanglement is bound and controlled. This suggests that an exact representation of…
The $\star_M$-family of tensor-tensor products is a framework which generalizes many properties from linear algebra to third order tensors. Here, we investigate positive semidefiniteness and semidefinite programming under the…
This work is a contribution to the understanding of the question of stability of Perfectly Matched Layers (PMLs) in corners, at continuous and discrete levels. First, stability results are presented for the Cartesian PMLs associated to a…
Model explainability is crucial for human users to be able to interpret how a proposed classifier assigns labels to data based on its feature values. We study generalized linear models constructed using sets of feature value rules, which…
The higher order matching problem is the problem of determining whether a term is an instance of another in the simply typed $\lambda$-calculus, i.e. to solve the equation a = b where a and b are simply typed $\lambda$-terms and b is…
Many logical properties are known to be undecidable for normal modal logics, with few exceptions such as consistency and coincidence with $\mathsf{K}$. This paper shows that the property of being a union-splitting in…
Automata for unordered unranked trees are relevant for defining schemas and queries for data trees in Json or Xml format. While the existing notions are well-investigated concerning expressiveness, they all lack a proper notion of…