Related papers: Balancing Extensions in Posets of Large Width
Stanley's inequalities for partially ordered sets establish important log-concavity relations for sequences of linear extensions counts. Their extremals however, i.e., the equality cases of these inequalities, were until now poorly…
Let (X_n,Y_n) be i.i.d. random vectors. Let W(x) be the partial sum of Y_n just before that of X_n exceeds x>0. Motivated by stochastic models for neural activity, uniform convergence of the form $\sup_{c\in I}|a(c,x)\operatorname…
We employ the combinatorial atlas technology to prove new correlation inequalities for the number of linear extensions of finite posets. These include the approximate independence of probabilities and expectations of values of random linear…
Given an underlying undirected simple graph, we consider the set of all acyclic orientations of its edges. Each of these orientations induces a partial order on the vertices of our graph and, therefore, we can count the number of linear…
This paper gives a theoretical analysis of high dimensional linear discrimination of Gaussian data. We study the excess risk of linear discriminant rules. We emphasis on the poor performances of standard procedures in the case when…
In many important statistical applications, the number of variables or parameters $p$ is much larger than the number of observations $n$. Suppose then that we have observations $y=X\beta+z$, where $\beta\in\mathbf{R}^p$ is a parameter…
The dimension of a partially ordered set $P$ (poset for short) is the least positive integer $d$ such that $P$ is isomorphic to a subposet of $\mathbb{R}^d$ with the natural product order. Dimension is arguably the most widely studied…
We prove that if a set is `large' in the sense of Erd\H{o}s, then it approximates arbitrarily long arithmetic progressions in a strong quantitative sense. More specifically, expressing the error in the approximation in terms of the gap…
Fourier extensions have been shown to be an effective means for the approximation of smooth, nonperiodic functions on bounded intervals given their values on an equispaced, or in general, scattered grid. Related to this method are two…
Although Bayes's theorem demands a prior that is a probability distribution on the parameter space, the calculus associated with Bayes's theorem sometimes generates sensible procedures from improper priors, Pitman's estimator being a good…
Sometimes, it is possible to represent a complicated polytope as a projection of a much simpler polytope. To quantify this phenomenon, the extension complexity of a polytope $P$ is defined to be the minimum number of facets of a (possibly…
This paper introduces a partial order on the maximal chains of any finite bounded poset $P$ which has a CL-labeling $\lambda$. We call this the maximal chain descent order induced by $\lambda$, denoted $P_{\lambda}(2)$. As a first example,…
The dimension of a poset $P$, denoted $\dim(P)$, is the least positive integer $d$ for which $P$ is the intersection of $d$ linear extensions of $P$. The maximum dimension of a poset $P$ with $|P|\le 2n+1$ is $n$, provided $n\ge2$, and this…
We study the gaps $\Delta p_n$ between consecutive rank sizes in $r$-differential posets by introducing a projection operator whose matrix entries can be expressed in terms of the number of certain paths in the Hasse diagram. We strengthen…
Let L be a positive line bundle over a projective complex manifold X. Consider the space of holomorphic sections of the tensor power of order p of L. The determinant of a basis of this space, together with some given probability measure on…
Recently a new approach to varying exponent $L^{p(\cdot)}$ space norms employing weak solutions to first order ordinary differential equations was initiated by the author. The duality of these ODE-determined $L^{p(\cdot)}$ spaces is…
We consider the problem of predicting as well as the best linear combination of d given functions in least squares regression under L^\infty constraints on the linear combination. When the input distribution is known, there already exists…
We study the well-posedness of Cauchy problems on the upper half space $\mathbb{R}^{n+1}_+$ associated to higher order systems $\partial_t u =(-1)^{m+1}\mbox{div}_m A\nabla ^m u$ with bounded measurable and uniformly elliptic coefficients.…
Many practical optimization problems lack strong convexity. Fortunately, recent studies have revealed that first-order algorithms also enjoy linear convergences under various weaker regularity conditions. While the relationship among…
Let $S$ be a sequence of points in $\Omega ,$ where $\Omega$ is the unit ball or the unit polydisc in ${\mathbb{C}}^{n}.$ Denote $H^{p}$($\Omega $) the Hardy space of $\Omega .$ Suppose that $S$ is $H^{p}$ interpolating with $p\geq 2.$ Then…