Related papers: Self-Correlation and Maximum Independence in Finit…
All spaces are assumed to be separable and metrizable. Our main result is that the statement "For every space $X$, every closed subset of $X$ has the perfect set property if and only if every analytic subset of $X$ has the perfect set…
We identify the correlation in a state of two identical particles as the residual information beyond what is already contained in the 1-particle reduced density matrix, and propose a correlation measure based on the maximum entropy…
Subobject independence as morphism co-possibility has recently been defined in [2] and studied in the context of algebraic quantum field theory. This notion of independence is handy when it comes to systems coming from physics, but when…
The asymptotic results that underlie applications of extreme random fields often assume that the variables are located on a regular discrete grid, identified with $\mathbb{Z}^2$, and that they satisfy stationarity and isotropy conditions.…
This note confirms a conjecture of [Bramoull\'{e}, Anti-coordination and social interactions, Games and Economic Behavior, 58, 2007: 30-49]. The problem, which we name the maximum independent cut problem, is a restricted version of the…
Given a finite group $G,$ we denote by $\Delta(G)$ the graph whose vertices are the elements $G$ and where two vertices $x$ and $y$ are adjacent if there exists a minimal generating set of $G$ containing $x$ and $y.$ We prove that…
A new notion of independence relation is given and associated to it, the class of flat theories, a subclass of strong stable theories including the superstable ones is introduced. More precisely, after introducing this independence…
We prove an upper bound for the independence number of a graph in terms of the largest Laplacian eigenvalue, and of a certain induced subgraph. Our bound is a refinement of a well-known Hoffman-type bound.
In this paper we present a self-contained macroscopic description of diffusive systems interacting with boundary reservoirs and under the action of external fields. The approach is based on simple postulates which are suggested by a wide…
Non-colliding Brownian particles in one dimension is studied. $N$ Brownian particles start from the origin at time 0 and then they do not collide with each other until finite time $T$. We derive the determinantal expressions for the…
Counting independent sets in graphs and hypergraphs under a variety of restrictions is a classical question with a long history. It is the subject of the celebrated container method which found numerous spectacular applications over the…
This paper introduces two matrix analogues for set partitions. A composition matrix on a finite set X is an upper triangular matrix whose entries partition X, and for which there are no rows or columns containing only empty sets. A…
Let G be a graph with maximum degree \Delta whose vertex set is partitioned into parts V(G) = V_1 \cup ... \cup V_r. A transversal is a subset of V(G) containing exactly one vertex from each part V_i. If it is also an independent set, then…
Let X be a set definable in a sharply o-minimal structure. We consider the problem of counting the number of points where X intersects algebraic varieties V over Q of dimension k < codim X, as a function of T := deg(V) + h(V), where h(V) is…
The linear complementarity problem is a continuous optimization problem that generalizes convex quadratic programming, Nash equilibria of bimatrix games and several such problems. This paper presents a continuous optimization formulation…
The independence density of a finite hypergraph is the probability that a subset of vertices, chosen uniformly at random contains no hyperedges. Independence densities can be generalized to countable hypergraphs using limits. We show that,…
We study the independence structure of finitely exchangeable distributions over random vectors and random networks. In particular, we provide necessary and sufficient conditions for an exchangeable vector so that its elements are completely…
A copula of continuous random variables $X$ and $Y$ is called an \emph{implicit dependence copula} if there exist functions $\alpha$ and $\beta$ such that $\alpha(X) = \beta(Y)$ almost surely, which is equivalent to $C$ being factorizable…
We show that the spontaneous symmetry breaking can be defined also for finite systems based on the properly defined jump probability between the ground states in the 2d and 3d Ising models on a square and a cubic lattice respectively. Our…
A maximal independent set in a graph $G$ is an independent set that cannot be extended to a larger independent set by adding any vertex from $G$. This paper investigates the problem of determining the maximum number of maximal independent…