相关论文: Brunn-Minkowski Inequalities for Contingency Table…

The Boolean product $R = P \cdot Q$ of two $\{ 0, 1\} \; m \times m \; $ matrices is $$R(j,k) = 1 \; \mathrm{\ IF\ for\ some\ } \; t \; \,P(j, t) = Q(t, k) = 1\; \; \mathrm{ELSE\ } \, R(j, k) = 0. $$ The near-optimal design reduces the…

Flow-based models are powerful tools for designing probabilistic models with tractable density. This paper introduces Convex Potential Flows (CP-Flow), a natural and efficient parameterization of invertible models inspired by the optimal…

We prove the validity of the $p$-Brunn-Minkowski inequality for the intrinsic volume $V_k$, $k=2,\dots, n-1$, of convex bodies in $\mathbb{R}^n$, in a neighborhood of the unit ball, for $0\le p<1$. We also prove that this inequality does…

We study "canonical weight decompositions" slightly generalizing that defined by J. Wildeshaus. For an triangulated category $C$, any integer $n$, and a weight structure $w$ on $C$ a triangle $LM\to M\to RM\to LM[1]$, where $LM$ is of…

Using spectral flow, we provide a proof of [11, Theorem 9.17] on unitarity of Ramond twisted non-extremal representations of unitary minimal $W$-algebras that does not rely on the still conjectural exactness of the twisted quantum reduction…

The Gauss-Minkowski correspondence in $\mathbb{R}^2$ states the existence of a homeomorphism between the probability measures $\mu$ on $[0,2\pi]$ such that $\int_0^{2\pi} e^{ix}d\mu(x)=0$ and the compact convex sets (CCS) of the plane with…

In bi-criteria optimization problems, the goal is typically to compute the set of Pareto-optimal solutions. Many algorithms for these types of problems rely on efficient merging or combining of partial solutions and filtering of dominated…

Finite mixtures of regressions with fixed covariates are a commonly used model-based clustering methodology to deal with regression data. However, they assume assignment independence, i.e. the allocation of data points to the clusters is…

In a previous paper the generator matrix elements and (dual) vector reduced Wigner coefficients (RWCs) were evaluated via the polynomial identities satisfied by a certain matrix constructed from the $R$-matrix $R$ and its twisted…

A chessboard has the property that every row and every column has as many white squares as black squares. In this mostly methodological note, we address the problem of counting such rectangular arrays with a fixed (numeric) number of rows,…

We find a semi-algebraic description of the Minkowski sum $\mathcal{A}_{3,n}$ of $n$ copies of the bounded twisted cubic $\{(t,t^2,t^3)\mid -1\leq t\leq 1\}$ for each integer $n\geq3$. These descriptions provide efficient membership tests…

World Input-Output (I/O) matrices provide the networks of within- and cross-country economic relations. In the context of I/O analysis, the methodology adopted by national statistical offices in data collection raises the issue of obtaining…

We extend the range of $N$ to negative values in the $(K,N)$-convexity (in the sense of Erbar--Kuwada--Sturm), the weighted Ricci curvature $Ric_N$ and the curvature-dimension condition $CD(K,N)$. We generalize a number of results in the…

Efficient resource allocation is one of the main driving forces of human civilizations. Of the many existing approaches to resource allocation, matrix completion is one that is frequently applied. In this paper, we investigate a special…

We present the ensemble expectation values for the translation invariant, rank-2 Minkowski tensors in three-dimensions, for a linearly redshift space distorted Gaussian random field. The Minkowski tensors $W^{0,2}_{1}$, $W^{0,2}_{2}$ are…

We consider the maximum weight $b$-matching problem in the random-order semi-streaming model. Assuming all weights are small integers drawn from $[1,W]$, we present a $2 - \frac{1}{2W} + \varepsilon$ approximation algorithm, using a memory…

A classic conjecture of F\"{u}redi, Kahn and Seymour (1993) states that given any hypergraph with non-negative edge weights $w(e)$, there exists a matching $M$ such that $\sum_{e \in M} (|e|-1+1/|e|)\, w(e) \geq w^*$, where $w^*$ is the…

A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. We prove a conjecture of McDiarmid, Steger, and Welsh, that says that…

Given convex polytopes $P_1,...,P_r$ in $R^n$ and finite subsets $W_I$ of the Minkowsky sums $P_I=\sum_{i \in I} P_i$, we consider the quantity $N(W)=\sum_{I \subset {\bf [}r {\bf ]}} {(-1)}^{r-|I|} \big| W_I \big|$. We develop a technique…

In this paper we consider a linear homogeneous system of $m$ equations in $n$ unknowns with integer coefficients over the reals. Assume that the sum of the absolute values of the coefficients of each equation does not exceed $k+1$ for some…