相关论文: Counting 3-way contingency tables via quiver semi-…

We study the problem of transforming a multi-way contingency table into an equivalent table with uniform margins and same dependence structure. Such a problem relates to recent developments in copula modeling for discrete random vectors.…

Deciding the existence of an $l\times m\times n$ integer threeway table with given line-sums is NP-complete already for fixed $l=3$, but is in P with both $l,m$ fixed. Here we consider {\em huge} tables, where the variable dimension $n$ is…

The notion of mixed representations of quivers can be derived from ordinary quiver representations by considering the dual action of groups on "vertex" vector spaces together with the usual action. A generating system for the algebra of…

The representations of dimension vector $\alpha$ of the quiver Q can be parametrised by a vector space $R(Q,\alpha)$ on which an algebraic group $\Gl(\alpha)$ acts so that the set of orbits is bijective with the set of isomorphism classes…

The analysis of contingency tables is a powerful statistical tool used in experiments with categorical variables. This study improves parts of the theory underlying the use of contingency tables. Specifically, the linkage disequilibrium…

For a point $p$ in a smooth real hypersurface $M\subset\C^n$, where the Levi form has the nontrivial kernel $K^{10}_p$, we introduce an invariant cubic tensor $\tau^3_p \colon \C T_p \times K^{10}_p \times \overline{K^{10}_p} \to \C\otimes…

Let R=(r_1, ..., r_m) and C=(c_1, ..., c_n) be positive integer vectors such that r_1 +... + r_m=c_1 +... + c_n. We consider the set Sigma(R, C) of non-negative mxn integer matrices (contingency tables) with row sums R and column sums C as…

We obtain sharp asymptotic estimates on the number of $n \times n$ contingency tables with two linear margins $Cn$ and $BCn$. The results imply a second order phase transition on the number of such contingency tables, with a critical value…

We prove an asymptotic estimate for the number of mxn non-negative integer matrices (contingency tables) with prescribed row and column sums and, more generally, for the number of integer feasible flows in a network. Similarly, we estimate…

A pathway from one vertex of a quiver to another is a reduced path. We modify the classical definition of quiver representations and we prove that semi-invariant polynomials for filtered quiver representations come from diagonal entries if…

A symmetric quiver $(Q,\sigma)$ is a finite quiver without oriented cycles $Q=(Q_0,Q_1)$ equipped with a contravariant involution $\sigma$ on $Q_0\sqcup Q_1$. The involution allows us to define a nondegenerate bilinear form $<,>$ on a…

We present a randomized approximation algorithm for counting contingency tables, mxn non-negative integer matrices with given row sums R=(r_1, ..., r_m) and column sums C=(c_1, ..., c_n). We define smooth margins (R,C) in terms of the…

We define and study virtual representation spaces having both positive and negative dimensions at the vertices of a quiver without oriented cycles. We consider the natural semi-invariants on these spaces which we call virtual…

$O(N)$ invariants are the observables of real tensor models. We use regular colored graphs to represent these invariants, the valence of the vertices of the graphs relates to the tensor rank. We enumerate $O(N)$ invariants as $d$-regular…

We study the geometric structure of the statistical models for two-by-two contingency tables. One or two odds ratios are fixed and the corresponding models are shown to be a portion of a ruled quadratic surface or a segment. Some pointers…

A binary contingency table is an m x n array of binary entries with prescribed row sums r=(r_1,...,r_m) and column sums c=(c_1,...,c_n). The configuration model for uniformly sampling binary contingency tables proceeds as follows. First,…

The $n$-queens problem is to determine $\mathcal{Q}(n)$, the number of ways to place $n$ mutually non-threatening queens on an $n \times n$ board. We show that there exists a constant $\alpha = 1.942 \pm 3 \times 10^{-3}$ such that…

Given m positive integers R=(r_i), n positive integers C=(c_j) such that sum r_i = sum c_j =N, and mn non-negative weights W=(w_{ij}), we consider the total weight T=T(R, C; W) of non-negative integer matrices (contingency tables)…

The second author and Katzarkov introduced categorical invariants based on counting of full triangulated subcategories in a given triangulated category $\mathcal T$, and they demonstrated different choices of additional properties of the…

Expert systems applications that involve uncertain inference can be represented by a multidimensional contingency table. These tables offer a general approach to inferring with uncertain evidence, because they can embody any form of…