Related papers: Independence in randomizations
We present a first-order theory of sequences with integer elements, Presburger arithmetic, and regular constraints, which can model significant properties of data structures such as arrays and lists. We give a decision procedure for the…
In this paper we study different concepts of independence for convex sets of probabilities. There will be two basic ideas for independence. The first is irrelevance. Two variables are independent when a change on the knowledge about one…
The spatial interaction between two or more classes (or species) has important consequences in many fields and might cause multivariate clustering patterns such as segregation or association. The spatial pattern of segregation occurs when…
We show that for many models of random trees, the independence number divided by the size converges almost surely to a constant as the size grows to infinity; the trees that we consider include random recursive trees, binary and $m$-ary…
Rice's theorem shows that nontrivial extensional properties of partial recursive functions are undecidable. For finite weighted Boolean optimization/CSP-style slices, a Rice-style structural analogue holds for tractability classification:…
A theory of structure is formulated for systems of many structureless classical particles with stable local interactions in Euclidean space. Such systems are shown to have their structure in thermodynamic equilibrium determined exactly by a…
To an algebraic variety equipped with an involution, we associate a cycle class in the modulo two Chow group of its fixed locus. This association is functorial with respect to proper morphisms having a degree and preserving the involutions.…
A combination of a finite number of linear independent states forms superposition in a way that cannot be conceived classically. Here, using the tools of resource theory of superposition, we give the conditions for a class of superposition…
We present a Lagrangian approach to counting degrees of freedom in first-order field theories. The emphasis is on the systematic attainment of a complete set of constraints. In particular, we provide the first comprehensive procedure to…
We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…
The paper deals with two issues: the existence of universal models of a theory T and related properties when cardinal arithmetic does not give this existence offhand. In the first section we prove that simple theories (e.g., theories…
Different formulations of special relativity are theoretically discussed. First an invariant formulation, i.e., the ''true transformations (TT) relativity,'' is exposed. There a physical quantity is represented by a true tensor which…
An $r$-sunflower is a collection of $r$ sets such that the intersection of any two sets in the collection is identical. We analyze a random process which constructs a $w$-uniform $r$-sunflower free family starting with an empty family and…
The $\mathcal{A}$-tracial algebras are algebras endowed with multi-linear forms, compatible with the product, and indexed by partitions. Using the notion of $\mathcal{A}$-cumulants, we define and study the $\mathcal{A}$-freeness property…
We propose a definition of tropical linear series that isolates some of the essential combinatorial properties of tropicalizations of not-necessarily-complete linear series on algebraic curves. The definition combines the Baker-Norine…
We show that there can be no finite list of conditional independence relations which can be used to deduce all conditional independence implications among Gaussian random variables. To do this, we construct, for each $n> 3$ a family of $n$…
We study the class $\mathcal{M}_{\mathrm{ratio}}$ of those probability distributions for which the free $R$-transforms are rational functions. This class is closed under the additive free convolution, additive free powers and under the…
We propose a new nonparametric test for the supposition of independence between two continuous random variables. The test is based on the size of the longest increasing subsequence of a random permutation. We identified the independence…
In this note we prove a large deviation bound on the sum of random variables with the following dependency structure: there is a dependency graph $G$ with a bounded chromatic number, in which each vertex represents a random variable.…
We introduce an atomic formula intuitively saying that given variables are independent from given other variables if a third set of variables is kept constant. We contrast this with dependence logic. We show that our independence atom gives…