Related papers: Weak Bases of Boolean Co-Clones
We introduce categories of weak factorization algebras and factorization spaces, and prove that they are equivalent to the categories of ordinary factorization algebras and spaces, respectively. This allows us to define the pullback of a…
Current pseudo-Boolean solvers implement different variants of the cutting planes proof system to infer new constraints during conflict analysis. One of these variants is generalized resolution, which allows to infer strong constraints, but…
We give a simple, elementary proof that a uniform algebra is weakly sequentially complete if and only if it is finite-dimensional.
A weakly constrained code is a collection of finite-length strings over a finite alphabet in which certain substrings or patterns occur according to some prescribed frequencies. Buzaglo and Siegel (ITW 2017) gave a construction of weakly…
Many recent studies have demonstrated that scaling arguments, such as the so-called hierarchical {\em ansatz}, are extremely useful in understanding the statistical properties of weak gravitational lensing. This is especially true on small…
We establish analogs of sharp weighted weak-type bounds for $m$-sublinear operators satisfying sparse form domination, including multilinear Calder\'on-Zygmund singular integrals. Our results, which hold for general $\vec{p} \in…
We will show under very weak conditions on differentiability and dependence that the central limit theorem for quantiles holds and that the block bootstrap is weakly consistent. Under slightly stronger conditions, the bootstrap is strongly…
Recently it has been shown that cumulants significantly simplify the analysis of multipartite weak measurements. Here we consider the mathematical structure that underlies this, and find that it can be formulated in terms of what we call…
Coresets for $k$-means and $k$-median problems yield a small summary of the data, which preserve the clustering cost with respect to any set of $k$ centers. Recently coresets have also been constructed for constrained $k$-means and…
We show that a minimal clone has a nontrivial weakly abelian representation iff it has a nontrivial abelian representation, and that in this case all representations are weakly abelian.
The article contains a survey of our results on weakly commensurable arithmetic and general Zariski-dense subgroups, length-commensurable and isospectral locally symmetric spaces and of related problems in the theory of semi-simple agebraic…
We study atom canonicity for several varieties of cylindric like algebras that contain properly the variety of representable algebras. The algebras in such varieties have relativized representations, and we thereby obtain many omitting…
In this paper, we will start by looking through our project's historical general view and then we will try to construct a new Poisson bracket on our simplest example $sl_2$ and then we will try to give a universal construction based on our…
We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…
The W-set of an element of a weak order poset is useful in the cohomological study of the closures of spherical subgroups in generalized flag varieties. We explicitly describe in a purely combinatorial manner the W-sets of the weak order…
Weak gravitational lensing of background galaxies provides a direct probe of the projected matter distribution in and around galaxy clusters. Here we present a self-contained pedagogical review of cluster--galaxy weak lensing, covering a…
We describe weak BCC-algebras (also called BZ-algebras) in which the condition $(xy)z=(xz)y$ is satisfied only in the case when elements $x,y$ belong to the same branch. We also characterize branchwise commutative and branchwise implicative…
We present a lattice Monte Carlo simulation for the evaluation of the spectrum of a confining Yang-Mills theory without Goldstone boson. We show that this theory is a very good candidate for describing composite weak bosons. In order to…
We introduce a general categorical framework for the definition of weak behavioural equivalences, building on and extending recent results in the field. This framework is based on parametrized saturation categories, i.e. categories whose…
Starting from a description of various generalized function algebras based on sequence spaces, we develop the general framework for considering linear problems with singular coefficients or non linear problems. Therefore, we prove…