Related papers: Self-Correlation and Maximum Independence in Finit…
The prime-coprime graph $\Theta(G)$ of a finite group $G$ is the simple graph with vertex set $G$, where two distinct elements are adjacent whenever the greatest common divisor of their orders is either $1$ or a prime. We characterize all…
In inflationary models where the source of scalar perturbations is not the inflaton, but one or more scalars with negligible coupling with the inflaton, the resulting perturbations are not only scale invariant, but fully conformally…
We consider analytic functions from a reproducing kernel Hilbert space. Given that such a function is of order $\epsilon$ on a set of discrete data points, relative to its global size, we ask how large can it be at a fixed point outside of…
We show that the stochastic independence of real-valued random variables is equivalent to the conditional uncorrelation, where the conditioning takes place over the Cartesian products of intervals. Next, we express the mutual independence…
We show that in algebraically locally finite countable homogeneous structures with a free stationary independence relation the small index property implies the strong small index property. We use this and the main result of [15] to deduce…
Let $R$ denote a 2-fir. The notions of F-independence and algebraic subsets of R are defined. The decomposition of an algebraic subset into similarity classes gives a simple way of translating the F-independence in terms of dimension of…
The graph theoretic concept of maximal independent set arises in several practical problems in computer science as well as in game theory. A maximal independent set is defined by the set of occupied nodes that satisfy some packing and…
Given a functor $F: \mathcal{C} \to \mathcal{D}$ and a model-theoretic independence relation on $\mathcal{D}$, we can lift that independence relation along $F$ to $\mathcal{C}$ by declaring a commuting square in $\mathcal{C}$ to be…
We argue that in the case of identical particles the most natural identification of separability, that is of absence of non-classical correlations, is via the factorization of mean values of commuting observables. It thus follows that…
Let G=(V,E). A set S is independent if no two vertices from S are adjacent. The number d(X)= |X|-|N(X)| is the difference of X, and an independent set A is critical if d(A) = max{d(I):I is an independent set}. Let us recall that ker(G) is…
We consider the problem of correlation functions in the stationary states of one-dimensional stochastic models having conformal invariance. If one considers the space dependence of the correlators, the novel aspect is that although one…
This paper is based on a talk in which I discussed how a component of the dynamical affine connection, that is independent of the metric, can drive inflation in agreement with observations. This provides a geometrical origin for the…
We show that there are polynomial-time algorithms to compute maximum independent sets in the categorical products of two cographs and two splitgraphs. The ultimate categorical independence ratio of a graph G is defined as lim_{k --> infty}…
We study the relation between the partition function of a non--relativistic particle, in one spatial dimension, that describes the equilibrium fluctuations implicitly, and the partition function of the same system, deduced from the Langevin…
We explore connections between the phenomenon of correlation decay and the location of Lee-Yang and Fisher zeros for various spin systems. In particular we show that, in many instances, proofs showing that weak spatial mixing on the Bethe…
Sparse-dense partitions was introduced by Feder, Hell, Klein, and Motwani [STOC 1999, SIDMA 2003] as a tool to solve partitioning problems. In this paper, the following result concerning independent sets in graphs having sparse-dense…
The demonstration and use of Bell-nonlocality, a concept that is fundamentally striking and is at the core of applications in device independent quantum information processing, relies heavily on the assumption of measurement independence,…
A continuous infinite system of point particles interacting via two-body strong superstable potential is considered in the framework of classical statistical mechanics. We define some kind of approximation of main quantities, which describe…
We prove that the form of conditional independence at play in database theory and independence logic is reducible to the first-order dividing calculus in the theory of atomless Boolean algebras. This establishes interesting connections…
We study the computational complexity of approximately counting the number of independent sets of a graph with maximum degree Delta. More generally, for an input graph G=(V,E) and an activity lambda>0, we are interested in the quantity…