Related papers: Random Variables with Completely Independent Subco…
A framework for quantifying dependence between random vectors is introduced. With the notion of a collapsing function, random vectors are summarized by single random variables, called collapsed random variables in the framework. Using this…
The holonomic rank of an A-hypergeometric system $H_A(\beta)$ is conjectured to be independent of the parameter vector $\beta$ if and only if the toric ideal $I_A$ is Cohen Macaulay. We prove this conjecture in the case that $I_A$ is…
When $I$ is the edge ideal of a graph $G$, we use combinatorial properities, particularly Property $P$ on connectivity of neighbors of an edge, to classify when a binomial sum of vertices is a regular element on $R/I(G)$. Under a mild…
The article concerns the geometrical theory of general systems $\Omega$ of partial differential equations in the \emph{absolute sense}, i.e., without any additional structure and subject to arbitrary change of variables in the widest…
We give a definition of some classes of boolean algebras generalizing free boolean algebras; they satisfy a universal property that certain functions extend to homomorphisms. We give a combinatorial property of generating sets of these…
The purpose of this paper is twofold. First, we provide a novel characterization of independence of random vectors based on the checkerboard approximation to a multivariate copula. Using this result, we then propose a new family of tests of…
We give necessary and sufficient conditions for two sub-vectors of a random vector with a multivariate extreme value distribution, corresponding to the limit distribution of the maximum of a multidimensional stationary sequence with…
We consider the intersection $\mathfrak{M}(A)$ of all maximal ideals of an evolution algebra $A$ and study the structure of the quotient $A/\M(A)$. In a previous work, maximal ideals have been related to hereditary subsets of a graph…
The Temperley-Lieb algebra \tln(\beta) can be defined as the set of rectangular diagrams with n points on each of their vertical sides, with all points joined pairwise by non-intersecting strings. The multiplication is then the…
A normal (respectively, graded normal) vector configuration $A$ defines the toric ideal $I_A$ of a normal (respectively, projectively normal) toric variety. These ideals are Cohen-Macaulay, and when $A$ is normal and graded, $I_A$ is…
In this paper we construct an entire function of two variables having the property that its values and its partial derivatives of any order at any distinct algebraic points are algebraically independent. Such an entire function is generated…
Let $Z$ be a random variable with values in a proper closed convex cone $C\subset \mathbb{R}^d$, $A$ a random endomorphism of $C$ and $N$ a random integer. We assume that $Z$, $A$, $N$ are independent. Given $N$ independent copies…
The enumeration of independent sets of regular graphs is of interest in statistical mechanics, as it corresponds to the solution of hard-particle models. In 2004, it was conjectured by Fendleyet al. that for some rectangular grids, with…
Since its introduction by Symons, the semigroup of maps with restricted range has been studied in the context of transformations on a set, or of linear maps on a vector space. Sets and vector spaces being particular examples of independence…
We introduce the notion of angular values for deterministic linear difference equations and random linear cocycles. We measure the principal angles between subspaces of fixed dimension as they evolve under nonautonomous or random linear…
We present a computational algebra solution to reverse engineering the network structure of discrete dynamical systems from data. We use monomial ideals to determine dependencies between variables that encode constraints on the possible…
Let $(R,\frak{m})$ be a $d$-dimensional Cohen-Macaulay local ring, $I$ an $\frak{m}$-primary ideal and $J$ a minimal reduction of $I$. In this paper we study the independence of reduction ideals and the behavior of the higher Hilbert…
We define a statistical ensemble of non-degenerate graphs, i.e. graphs without multiple- and self-connections between nodes. The node degree distribution is arbitrary, but the nodes are assumed to be uncorrelated. This completes our earlier…
We define and study a metric independence notion in a homogeneous metric abstract elementary class with perturbations that is $d^p$-superstable (superstable wrt. the perturbation topology), weakly simple and has complete type spaces and we…
Compositional graphoids are fundamental discrete structures which appear in probabilistic reasoning, particularly in the area of graphical models. They are semigraphoids which satisfy the Intersection and Composition properties. These…