Related papers: A generalized marriage theorem
In this work, we propose a global model selection criterion to estimate the graph of conditional dependencies of a random vector based on a finite sample. By global criterion, we mean optimizing a function over the entire set of possible…
We determine all values of the parameters for which the cell modules form a standard system, for a class of cellular diagram algebras including partition, Brauer, walled Brauer, Temperley-Lieb and Jones algebras. For this, we develop and…
This paper gives a generic form of the diamond lemma, which includes support for additive and topological structures of the base set, and which does not require any further structure (e.g. an associative multiplication operation) to be…
Stable marriage of a two-sided market with unit demand is a classic problem that arises in many real-world scenarios. In addition, a unique stable marriage in this market simplifies a host of downstream desiderata. In this paper, we explore…
Crossed complexes are shown to have an algebra sufficiently rich to model the geometric inductive definition of simplices, and so to give a purely algebraic proof of the Homotopy Addition Lemma (HAL) for the boundary of a simplex. This…
We extend some sharp inequalities for martingale-differences to general multiplicative systems of random variables. The key ingredient in the proofs is a technique reducing the general case to the case of Rademacher random variables without…
We prove necessary and sufficient criteria of invertibility for planar harmonic mappings which generalize a classical result of H. Kneser, also known as the Rad\'{o}-Kneser-Choquet theorem.
We introduce a generalized version of the famous Stable Marriage problem, now based on multi-modal preference lists. The central twist herein is to allow each agent to rank its potentially matching counterparts based on more than one…
We prove a general large sieve statement in the context of random walks on subgraphs of a given graph. This can be seen as a generalization of previously known results where one performs a random walk on a group enjoying a strong spectral…
Pairwise comparison matrix as a crucial component of AHP, presents the prefer- ence relations among alternatives. However, in many cases, the pairwise comparison matrix is difficult to complete, which obstructs the subsequent operations of…
We initiate the study of the Diverse Pair of (Maximum/ Perfect) Matchings problems which given a graph $G$ and an integer $k$, ask whether $G$ has two (maximum/perfect) matchings whose symmetric difference is at least $k$. Diverse Pair of…
We present a fascinating model that has lately caught attention among physicists working in complexity related fields. Though it originated from mathematics and later from economics, the model is very enlightening in many aspects that we…
Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over a field and $A$ a standard graded $S$-algebra. In terms of the Gr\"obner basis of the defining ideal $J$ of $A$ we give a condition, called the x-condition, which implies that all graded…
Despite the number of relevant considerations in the literature, the algebra of generalized symmetries of the Burgers equation has not been exhaustively described. We fill this gap, presenting a basis of this algebra in an explicit form and…
Let K be an infinite field and let R be a K-algebra endowed with a homogeneous polynomial norm N of degree n. If N satisfies a formal analogue of the Cayley-Hamilton Theorem the we will show that R is a quotient of the ring of the…
A social group is represented by a graph, where each pair of nodes is connected by two oppositely directed links. At the beginning, a given amount $p(i)$ of resources is assigned randomly to each node $i$. Also, each link $r(i,j)$ is…
This paper introduces a reformulation of the classical convergence theorem for spectral sequences of filtered complexes which provides an algorithm to effectively compute the induced filtration on the total (co)homology, as soon as the…
The general correlation function for the eigenvalues of $p$ complex hermitian matrices coupled in a chain is given as a single determinant. For this we use a slight generalization of a theorem of Dyson.
The classical Artin--Whaples approximation theorem allows to simultaneously approximate finitely many different elements of a field with respect to finitely many pairwise inequivalent absolute values. Several variants and generalizations…
This article concerns a class of generalized linear mixed models for clustered data, where the random effects are mapped uniquely onto the grouping structure and are independent between groups. We derive necessary and sufficient conditions…