Pages that link to "Item:Q1039627"

The following pages link to Simple upper bounds for partition functions (Q1039627):

Displaying 20 items.

• On the dimension of matrix embeddings of torsion-free nilpotent groups (Q517082) (← links)
• On number of partitions of an integer into a fixed number of positive integers (Q746947) (← links)
• A shortest path-based approach to the multileaf collimator sequencing problem (Q765342) (← links)
• Gaussian polytopes: a cumulant-based approach (Q1635836) (← links)
• A Polyakov formula for sectors (Q1651390) (← links)
• Effective bounds for Fourier coefficients of certain weakly holomorphic modular forms (Q1651988) (← links)
• Divisor sequences of atoms in Krull monoids (Q2154970) (← links)
• On explaining integer vectors by few homogeneous segments (Q2256725) (← links)
• Estimates for the norms of products of sines and cosines (Q2257145) (← links)
• Polynomial approximation of anisotropic analytic functions of several variables (Q2663138) (← links)
• On the cardinality of lower sets and universal discretization (Q2693687) (← links)
• On the Malle–Navarro conjecture for 2- and 3-blocks of general linear and unitary groups (Q3386859) (← links)
• (Q4430616) (← links)
• (Q4456193) (← links)
• On the involution fixity of simple groups (Q4999898) (← links)
• Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters (Q5111220) (← links)
• Quasi-Monte Carlo and Multilevel Monte Carlo Methods for Computing Posterior Expectations in Elliptic Inverse Problems (Q5269873) (← links)
• On the number of conjugacy classes of a primitive permutation group (Q5880814) (← links)
• Estimates on binomial sums of partition functions (Q5928170) (← links)
• On the parameterized complexity of the acyclic matching problem (Q6038700) (← links)