The following pages link to IPFS content identifier (P1633):
Displaying 50 items.
- A \(\beta\) invariant for greedoids and antimatroids (Q1378502) (← links)
- A plethysm formula for \(p_ \mu(\underline x)\circ h_ \lambda(\underline x)\) (Q1378503) (← links)
- Magic \(N\)-cubes form a free monoid (Q1378504) (← links)
- A matrix dynamics approach to Golomb's recursion (Q1378506) (← links)
- Analysis of an asymmetric leader election algorithm (Q1378508) (← links)
- Threshold functions for the bipartite Turán property (Q1378511) (← links)
- On the function ``sandwiched'' between \(\alpha(G)\) and \(\bar\chi (G)\) (Q1378512) (← links)
- Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees (Q1378513) (← links)
- Some applications of the proper and adjacency polynomials in the theory of graph spectra (Q1378514) (← links)
- Asymptotics of Young diagrams and hook numbers (Q1378515) (← links)
- Limit probabilities for random sparse bit strings (Q1378516) (← links)
- Hook lengths in a skew Young diagram (Q1378517) (← links)
- Tight upper bounds for the domination numbers of graphs with given order and minimum degree (Q1378519) (← links)
- Determinant identities and a generalization of the number of totally symmetric self-complementary plane partitions (Q1378520) (← links)
- Frankl-Füredi type inequalities for polynomial semi-lattices (Q1378521) (← links)
- Combinatorial approaches and conjectures for 2-divisibility problems concerning domino tilings of polyominoes (Q1378522) (← links)
- An eigenvalue characterization of antipodal distance-regular graphs (Q1378523) (← links)
- An exact performance bound for an \(O(m+n)\) time greedy matching procedure (Q1378525) (← links)
- A tribute to Herbert S. Wilf in celebration of his 65th birthday (Q1378528) (← links)
- Generating random elements of finite distributive lattices (Q1378529) (← links)
- Generating functions and generalized Dedekind sums. (Q1378530) (← links)
- Combinatorial game theory foundations applied to digraph kernels (Q1378531) (← links)
- Parking functions and noncrossing partitions (Q1378532) (← links)
- From recursions to asymptotics: On Szekeres' formula for the number of partitions (Q1378533) (← links)
- Escher's combinatorial patterns (Q1378535) (← links)
- A purely combinatorial proof of the Hadwiger Debrunner \((p,q)\) conjecture (Q1378536) (← links)
- Ramanujan's method in \(q\)-series congruences (Q1378537) (← links)
- Hypergeometric series acceleration via the WZ method (Q1378538) (← links)
- A note on major sequences and external activity in trees (Q1378539) (← links)
- Random walks on generating sets for finite groups (Q1378540) (← links)
- On cycles in the coprime graph of integers (Q1378541) (← links)
- Basic calculus of signed permutations. II: Finite analogues of Bessel functions (Q1378542) (← links)
- Some geometric probability problems involving the Eulerian numbers (Q1378544) (← links)
- Real time asymptotic packing (Q1378545) (← links)
- When can the sum of \((1/p)\)th of the binomial coefficients have closed form (Q1378546) (← links)
- Dodgon's determinant-evaluation rule proved by TWO-TIMING MEN and WOMEN (Q1378547) (← links)
- On a tiling scheme from M. C. Escher (Q1378549) (← links)
- Shape tiling (Q1378550) (← links)
- New upper bounds on the order of cages (Q1378551) (← links)
- Monotonic subsequences in dimensions higher than one (Q1378553) (← links)
- The last digit of \(\binom {2n}n\) and \(\sum \binom ni\binom{2n-2i}{n-1}\) (Q1378555) (← links)
- Evaluations of \(k\)-fold Euler/Zagier sums: a compendium of results for arbitrary \(k\) (Q1378557) (← links)
- New symmetric designs from regular Hadamard matrices (Q1379123) (← links)
- Lattice walks in \({\mathbf Z}^ d\) and permutations with no long ascending subsequences (Q1379124) (← links)
- A construction for sets of integers with distinct subset sums (Q1379125) (← links)
- An improved bound on the minimal number of edges in color-critical graphs (Q1379126) (← links)
- Periodic sorting using minimum delay, recursively constructed merging networks (Q1379127) (← links)
- Permutations which are the union of an increasing and a decreasing subsequence (Q1379128) (← links)
- All Ramsey numbers \(r(K_ 3,G)\) for connected graphs of order 9 (Q1379130) (← links)
- Multimatroids. II: Orthogonality, minors and connectivity (Q1379131) (← links)
