Related papers: Weak Bases of Boolean Co-Clones
Weak measurement is a new technique which allows one to describe the evolution of postselected quantum systems. It appears to be useful for resolving a variety of thorny quantum paradoxes, particularly when used to study properties of pairs…
In this paper, we show that a completely positive linear map is weakly nuclear if and only if its complexification is weakly nuclear. It is shown that a real $C^*$-algebra is exact if and only if its complexification is exact and similar…
We study centralizer clones of finite lattices and semilattices. For semilattices, we give two characterizations of the centralizer and also derive formulas for the number of operations of a given essential arity in the centralizer. We also…
The weakly relational domain of Octagons offers a decent compromise between precision and efficiency for numerical properties. Here, we are concerned with the construction of non-numerical relational domains. We provide a general…
We study the lattice of all Borel clones on $2 = \{0,1\}$: classes of Borel functions $f : 2^n \to 2$, $n \le \omega$, which are closed under composition and include all projections. This is a natural extension to countable arities of…
A family of quantum cluster algebras is introduced and studied. In general, these algebras are new, but subclasses have been studied previously by other authors. The algebras are indexed by double partitions or double flag varieties.…
One of the central problems studied in the theory of machine learning is the question of whether, for a given class of hypotheses, it is possible to efficiently find a {consistent} hypothesis, i.e., which has zero training error. While…
Clones of functions play a foundational role in both universal algebra and theoretical computer science. In this work, we introduce clone merge monoids (cm-monoids), a unifying one-sorted algebraic framework that integrates abstract clones,…
Weak gravitational lensing of background galaxies is a unique, direct probe of the distribution of matter in clusters of galaxies. We review several important aspects of cluster weak gravitational lensing together with recent advances in…
On an infinite base set X, every ideal of subsets of X can be associated with the clone of those operations on X which map small sets to small sets. We continue earlier investigations on the position of such clones in the clone lattice.
Cooperative constraint solving is an area of constraint programming that studies the interaction between constraint solvers with the aim of discovering the interaction patterns that amplify the positive qualities of individual solvers.…
Accurately segmenting a citation string into fields for authors, titles, etc. is a challenging task because the output typically obeys various global constraints. Previous work has shown that modeling soft constraints, where the model is…
Smoothed analysis of complexity bounds and condition numbers has been done, so far, on a case by case basis. In this paper we consider a reasonably large class of condition numbers for problems over the complex numbers and we obtain…
Methods of Lie group analysis of differential equations are extended to weak solutions of (linear and nonlinear) PDEs, where the term ``weak solution'' comprises the following settings: (a) Distributional solutions. (b) Solutions in…
We initiate in this article the study of weakly exact structures, a generalization of Quillen exact structures. We introduce weak counterparts of one-sided exact structures and show that a left and a right weakly exact structure generate a…
It will be seen that if $H$ is a weak Hopf algebra in the definition of coaction of weak bialgebras on coalgebras \cite{Wang}, then a definition property is suppressed giving rise to the (global) coactions of weak Hopf algebras on…
We present an $O(n\log n)$-time algorithm that determines whether a given planar $n$-gon is weakly simple. This improves upon an $O(n^2\log n)$-time algorithm by Chang, Erickson, and Xu (2015). Weakly simple polygons are required as input…
We present a relatively simple description of binary, definable subsets of models of weakly quasi-o-minimal theories. In particular, we closely describe definable linear orders and prove a weak version of the monotonicity theorem. We also…
We investigate weakly constrained codes, in which specific patterns occur with prescribed frequencies rather than being strictly forbidden as in conventional constrained coding. We propose a capacity-achieving construction of a weakly…
In an attempt to create an algebraic framework for dual canonical bases and total positivity in semisimple groups, we initiate the study of a new class of commutative algebras.