Effective Poset Inequalities
From MaRDI portal
Publication:6046818
Abstract: We explore inequalities on linear extensions of posets and make them effective in different ways. First, we study the Bj"orner--Wachs inequality and generalize it to inequalities on order polynomials and their -analogues via direct injections and FKG inequalities. Second, we give an injective proof of the Sidorenko inequality with computational complexity significance, namely that the difference is in . Third, we generalize the Sidorenko inequality to posets with small chain intersections and give complexity theoretic applications.
Recommendations
- Log-concave poset inequalities (extended abstract)
- scientific article; zbMATH DE number 1488842
- On the posets \((\mathcal W_2^k,<)\) and their connections with some homogeneous inequalities of degree 2
- Multivariate correlation inequalities for \(P\)-partitions
- A correlational inequality for linear extensions of a poset
Cites work
- scientific article; zbMATH DE number 6016068 (Why is no real title available?)
- scientific article; zbMATH DE number 3842627 (Why is no real title available?)
- scientific article; zbMATH DE number 4104976 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 480247 (Why is no real title available?)
- scientific article; zbMATH DE number 568836 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1072530 (Why is no real title available?)
- scientific article; zbMATH DE number 857389 (Why is no real title available?)
- scientific article; zbMATH DE number 3893259 (Why is no real title available?)
- A Rogers-Ramanujan bijection
- A \(q\)-analogue of the FKG inequality and some applications
- A correlational inequality for linear extensions of a poset
- A loop-free algorithm for generating the linear extensions of a poset
- A recurrence for linear extensions
- Asymptotics of the number of standard Young tableaux of skew shape
- Bijections related to statistics on words
- Bijective proofs of the hook formula for rooted trees.
- Chromatic graph theory
- Combinatorial Inequalities
- Combinatorial Markov chains on linear extensions
- Combinatorial applications of the Hodge-Riemann relations
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Computational Complexity
- Computing the Continuous Discretely
- Correlation inequalities on some partially ordered sets
- Counting linear extensions
- Counting linear extensions of restricted posets
- Deciding positivity of Littlewood-Richardson coefficients
- Dual equivalence with applications, including a conjecture of Proctor
- Evacuation of labelled graphs
- Extensions of the Kahn-Saks inequality for posets of width two
- Friends and strangers walking on graphs
- Generating a random linear extension of a partial order
- Geometric inequalities for anti-blocking bodies
- Geometrical techniques for estimating numbers of linear extensions
- Geometry and complexity of O'Hara's algorithm
- Hook inequalities
- How often are two permutations comparable?
- Inductive proofs of \(q\)-log concavity
- Inequalities for the number of linear extensions
- Introduction to the combinatorial atlas
- Multivariate correlation inequalities for \(P\)-partitions
- On \(q\)-integrals over order polytopes
- On log concavity for order-preserving maps of partial orders
- On positivity of Ehrhart polynomials
- On the complexity of computing Kronecker coefficients
- On the conductance of order Markov chains
- On the q-log-concavity of Gaussian binomial coefficients
- Order polynomials and Pólya's enumeration theorem.
- Product decompositions of the symmetric group induced by separable permutations
- Promotion and evacuation
- Promotion des morphismes d'ensembles ordonnes
- Promotion sorting
- Reduced matrices and q-log-concavity properties of q-Stirling numbers
- Separable elements and splittings of Weyl groups
- Skew shape asymptotics, a case-based introduction
- Stanley's non-Ehrhart-positive order polytopes
- Systems of equations with a single solution
- The FKG Inequality and Some Monotonicity Properties of Partial Orders
- The XYZ conjecture and the FKG inequality
- The bounds for the number of linear extensions via chain and antichain coverings
- The cross-product conjecture for width two posets
- The extremals of Minkowski's quadratic inequality
- The hull metric on Coxeter groups
- The nature of computation
- The probabilistic method
- Two combinatorial applications of the Aleksandrov-Fenchel inequalities
- Two poset polytopes
- Unimodality, log-concavity, real-rootedness and beyond
- Upper Bounds on Mixing Time of Finite Markov Chains
- When is the multiplicity of a weight equal to 1?
- Why is pi less than twice phi?
- \(q\)-analogues of Ehrhart polynomials
- q-hook length formulas for forests
Cited in
(7)- Log-concave poset inequalities (extended abstract)
- On the posets \((\mathcal W_2^k,<)\) and their connections with some homogeneous inequalities of degree 2
- Enumerative combinatorics. Abstracts from the workshop held December 11--17, 2022
- Equality cases of the Alexandrov-Fenchel inequality are not in the polynomial hierarchy
- Extensions of the Kahn-Saks inequality for posets of width two
- Log-concave poset inequalities
- Correlation inequalities for linear extensions
This page was built for publication: Effective Poset Inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6046818)
