Related papers: Atomic Pseudo-Valuation Domains
We prove the existence of a continuous $BV$ minimizer with $C^{0}$ boundary value for the $p$-area (pseudohermitian or horizontal area) in a parabolically convex bounded domain. We extend the domain of the area functional from $BV$…
The notion of maximal non valuative domain is introduced and characterized. An integral domain R is called a maximal non valuative domain if R is not a valuative domain but every proper overring of R is a valuative domain. Maximal non…
We investigate a form of visibility introduced recently by Bharali and Zimmer -- and shown to be possessed by a class of domains called Goldilocks domains. The range of theorems established for these domains stem from this form of…
Domain walls can be formed in superconductors with a discrete degeneracy of the ground state, for instance, due to the breaking of time reversal symmetry. We study all cases where the formation of domain walls is possible in a tetragonal…
We provide two main contributions in PAC-Bayesian theory for domain adaptation where the objective is to learn, from a source distribution, a well-performing majority vote on a different, but related, target distribution. Firstly, we…
Global quantization of pseudo-differential operators on compact Lie groups is introduced relying on the representation theory of the group rather than on expressions in local coordinates. Operators on the 3-dimensional sphere and on group…
The concept of $L$-special domain appeared in the early 2000s. This analytical characteristic of domains in the complex plane is related to the problem on uniform approximation of functions on Carath\'eodory compacts in $\mathbb{R}^2$ by…
Domain operations on semirings have been axiomatised in two different ways: by a map from an additively idempotent semiring into a boolean subalgebra of the semiring bounded by the additive and multiplicative unit of the semiring, or by an…
We study the existence of pairwise stable allocations in matching markets with contracts and propose a domain restriction that guarantees their existence. Specifically, we define pseudo-substitutable preferences, a domain that strictly…
A finite-dimensional pseudo-unitary framework is set up for describing the dynamics of free elementary particles in a purely relativistic quantum mechanical way. States of any individual particles or antiparticles are defined as suitably…
The most developed aspect of the theory of finite semigroups is their classification in pseudovarieties. The main motivation for investigating such entities comes from their connection with the classification of regular languages via…
We study the evolution of biased domain walls in the early universe. We explicitly discuss the roles played by the surface tension and volume pressure in the evolution of the walls, and quantify their effects by looking at the collapse of…
This article is the second part in the series of articles where we are developing theory of valuations on manifolds. Roughly speaking valuations could be thought as finitely additive measures on a class of nice subsets of a manifold which…
The mathematical framework of Stone duality is used to synthesize a number of hitherto separate developments in Theoretical Computer Science: - Domain Theory, the mathematical theory of computation introduced by Scott as a foundation for…
In this article we introduce associative Look-Up Tables. With their help, pseudo sums are correctly determined. The set of limit distributions in a pseudo-summation scheme of i.i.d. random variables is described. Also, two special cases…
In the 1960s, Atkinson introduced an abstract algebraic setting for multiparameter eigenvalue problems. He showed that a nonsingular multiparameter eigenvalue problem is equivalent to the associated system of generalized eigenvalue…
A new criterion is given for a semigroup to be the semigroup of a valuation dominating an equicharacteristic local domain. The criterion is used to construct examples of well ordered subsemigroups of the positive rational numbers which are…
We introduce a variant of free logic (i.e., a logic admitting terms with nonexistent referents) that accommodates truth-value gluts as well as gaps. Employing a suitable expansion of the Belnap-Dunn four-valued logic, we specify a…
We introduce a new representation learning algorithm suited to the context of domain adaptation, in which data at training and test time come from similar but different distributions. Our algorithm is directly inspired by theory on domain…
A generalization of Scott's information systems~\cite{sco82} is presented that captures exactly all continuous domains. The global consistency predicate in Scott's definition is relativized. Now, for every atomic statement, there is a…