English
Related papers

Related papers: Balancing Extensions in Posets of Large Width

200 papers

We show that if we have an orthogonal base ($u_1,\ldots,u_p$) in a $p$-dimensional vector space, and select $p+1$ vectors $v_1,\ldots, v_p$ and $w$ such that the vectors traverse the origin, then the probability of $w$ being to closer to…

Probability · Mathematics 2014-04-22 Daniel A. Diaz-Pachon , J. Sunil Rao , Jean-Eudes Dazard

The multiple extension problem arises frequently in diagnostic and default inference. That is, we can often use any of a number of sets of defaults or possible hypotheses to explain observations or make Predictions. In default inference,…

Artificial Intelligence · Computer Science 2013-04-11 Eric Neufeld , David L Poole

We demonstrate $k+1$-term arithmetic progressions in certain subsets of the real line whose "higher-order Fourier dimension" is sufficiently close to 1. This Fourier dimension, introduced in previous work, is a higher-order (in the sense of…

Classical Analysis and ODEs · Mathematics 2015-01-20 Marc Carnovale

Linear models with a growing number of parameters have been widely used in modern statistics. One important problem about this kind of model is the variable selection issue. Bayesian approaches, which provide a stochastic search of…

Statistics Theory · Mathematics 2012-02-03 Zuofeng Shang , Murray K. Clayton

The dimension is a key measure of complexity of partially ordered sets. Small dimension allows succinct encoding. Indeed if $P$ has dimension $d$, then to know whether $x \leq y$ in $P$ it is enough to check whether $x\leq y$ in each of the…

Combinatorics · Mathematics 2019-12-12 Stefan Felsner , Tamás Mészáros , Piotr Micek

Felsner and Reuter introduced the linear extension diameter of a partially ordered set $\mathbf{P}$, denoted $\mbox{led}(\mathbf{P})$, as the maximum distance between two linear extensions of $\mathbf{P}$, where distance is defined to be…

Combinatorics · Mathematics 2015-07-07 Graham Brightwell , Mitchel T. Keller

The $1/3$-$2/3$ Conjecture, originally formulated in 1968, is one of the best-known open problems in the theory of posets, stating that the balance constant (a quantity determined by the linear extensions) of any non-total order is at least…

Combinatorics · Mathematics 2024-09-17 Christian Gaetz , Yibo Gao

For every partial combinatory algebra (pca), we define a hierarchy of extensionality relations using ordinals. We investigate the closure ordinals of pca's, i.e. the smallest ordinals where these relations become equal. We show that the…

Logic · Mathematics 2021-09-17 Paul Shafer , Sebastiaan A. Terwijn

Given a finite poset P, we consider pairs of linear extensions of P with maximal distance, where the distance between two linear extensions L_1, L_2 is the number of pairs of elements of P appearing in different orders in L_1 and L_2. A…

Combinatorics · Mathematics 2008-09-11 Graham Brightwell , Mareike Massow

We give a broad survey of inequalities for the number of linear extensions of finite posets. We review many examples, discuss open problems, and present recent results on the subject. We emphasize the bounds, the equality conditions of the…

Combinatorics · Mathematics 2025-06-05 Swee Hong Chan , Igor Pak

We study the classical problem of predicting an outcome variable, $Y$, using a linear combination of a $d$-dimensional covariate vector, $\mathbf{X}$. We are interested in linear predictors whose coefficients solve: % \begin{align*}…

Statistics Theory · Mathematics 2024-04-10 José Luis Montiel Olea , Cynthia Rush , Amilcar Velez , Johannes Wiesel

Given a large set $U$ where each item $a\in U$ has weight $w(a)$, we want to estimate the total weight $W=\sum_{a\in U} w(a)$ to within factor of $1\pm\varepsilon$ with some constant probability $>1/2$. Since $n=|U|$ is large, we want to do…

Data Structures and Algorithms · Computer Science 2021-10-29 Lorenzo Beretta , Jakub Tětek

Let $X$ be the number of $k$-term arithmetic progressions contained in the $p$-biased random subset of the first $N$ positive integers. We give asymptotically sharp estimates on the logarithmic upper-tail probability $\log \Pr(X \ge E[X] +…

Probability · Mathematics 2024-09-16 Matan Harel , Frank Mousset , Wojciech Samotij

For a partial order $\preceq$ on a set X and an equivalency relation S defined on the same set X we derive a necessary and sufficient condition for the existence of such a total preorder on X whose asymmetric part contains the asymmetric…

Functional Analysis · Mathematics 2011-11-08 Dmitry V. Akopian , Valentin V. Gorokhovik

A variety of possible extensions of mappings between posets to their Dedekind order completion is presented. One of such extensions has recently been used for solving large classes of nonlinear systems of partial differential equations with…

General Mathematics · Mathematics 2007-05-23 Elemer E Rosinger

We consider a school choice matching model where the priorities for schools are represented by binary relations that may not be weak order. We focus on the (total order) extensions of the binary relations. We introduce a class of algorithms…

Theoretical Economics · Economics 2023-10-13 Minoru Kitahara , Yasunori Okumura

We propose a new, more general definition of extended probability measures. We study their properties and provide a behavioral interpretation. We put them to use in an inference procedure, whose environment is canonically represented by the…

Statistics Theory · Mathematics 2023-01-13 Michele Caprio , Sayan Mukherjee

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

Combinatorics · Mathematics 2013-01-04 Terence Tao

An $\alpha$-greedy balanced pair in an ordered set $P=(V,\leq)$ is a pair $(x,y)$ of elements of $V$ such that the proportion of greedy linear extensions of $P$ that put $x$ before $y$ among all greedy linear extensions is in the real…

Combinatorics · Mathematics 2020-10-13 Imed Zaguia

We consider upper exponential bounds for the probability of the event that an absolute deviation of sample mean from mathematical expectation p is bigger comparing with some ordered level epsilon. These bounds include 2 coefficients {alpha,…

Probability · Mathematics 2010-04-13 Vladimir Nikulin