The following pages link to Combinatorial theory. (Q2565249):
Displaying 50 items.
- On \(n\)-arithmetical triangles constructed for polynomial coefficients (Q328765) (← links)
- Multicuts and perturb \& MAP for probabilistic graph clustering (Q334274) (← links)
- The lattice of finite subspace partitions (Q408191) (← links)
- Eigenvalues and equivalent transformation of a trigonometric matrix associated with filter design (Q454836) (← links)
- Relation spaces of hyperplane arrangements and modules defined by graphs of fiber zonotopes (Q466112) (← links)
- The recombination equation for interval partitions (Q509704) (← links)
- A new view of relationship between atomic posets and complete (algebraic) lattices (Q521574) (← links)
- Lattice flows in networks (Q522926) (← links)
- Sampling complete designs (Q658083) (← links)
- The link between segregation and phylogenetic diversity (Q662584) (← links)
- Fischer matrices for generalised symmetric groups -- a combinatorial approach (Q696833) (← links)
- Orthogonality matrices for modules over finite Frobenius rings and MacWilliams' equivalence theorem (Q700162) (← links)
- Haldane linearisation done right: solving the nonlinear recombination equation the easy way (Q727402) (← links)
- Asymptotic probabilities of extension properties and random \(l\)-colourable structures (Q764265) (← links)
- On matroid parity and matching polytopes (Q777400) (← links)
- An elementary approach to the location of the maximum Stirling number(s) of the second kind (Q841462) (← links)
- Finitary topos for locally finite, causal and quantal vacuum Einstein gravity (Q880980) (← links)
- Ring graphs and complete intersection toric ideals (Q960950) (← links)
- The Sylvester-Gallai theorem, colourings and algebra (Q998535) (← links)
- Ring geometries, two-weight codes, and strongly regular graphs (Q1009016) (← links)
- Diagrams for modular lattices (Q1064330) (← links)
- On the computational complexity of the order polynomial (Q1086595) (← links)
- Enumeration of injective partial transformations (Q1117933) (← links)
- Producing posets (Q1151047) (← links)
- A topological representation of lattices (Q1193504) (← links)
- Search and sweep numbers of finite directed acyclic graphs (Q1208460) (← links)
- Symmetrische Zerlegung von Kettenprodukten (Q1226101) (← links)
- Atomic semicommutations (Q1314382) (← links)
- Finite-ring combinatorics and MacWilliams' equivalence theorem (Q1586124) (← links)
- Inequalities for the number of monotonic functions of partial orders (Q1820178) (← links)
- A new matching property for posets and existence of disjoint chains (Q1881683) (← links)
- Equicovering matroids by distinct bases (Q1891366) (← links)
- Extremal problems for the Möbius function in the face lattice of the \(n\)-octahedron (Q1893995) (← links)
- Foundations of enumeration theory for finite nilpotent groups (Q1925324) (← links)
- An almost accurate location of the maximum Stirling number(s) of the second kind (Q1930327) (← links)
- A compact representation for modular semilattices and its applications (Q2006979) (← links)
- The \(r\)-Stirling numbers of the first kind in terms of the Möbius function (Q2038997) (← links)
- Discrete orthogonal transforms on multisets associated with complete sequences (Q2043620) (← links)
- Particular solutions of equations with multiple characteristics expressed through hypergeometric functions (Q2120847) (← links)
- On axiomatizability of the class of finitary matroids and decidability of their universal theory (Q2212712) (← links)
- Evaluation codes and their basic parameters (Q2227126) (← links)
- Riordan posets and associated incidence matrices (Q2244886) (← links)
- On the irrationality of factorial series. II (Q2268797) (← links)
- Posets with maximal Möbius function (Q2277456) (← links)
- The power of randomness in Bayesian optimal mechanism design (Q2347783) (← links)
- On the linear classification of even and odd permutation matrices and the complexity of computing the permanent (Q2359079) (← links)
- A geometric study of cores of idempotent stochastic matrices (Q2359560) (← links)
- One more well-solved case of the multifacility location problem (Q2386213) (← links)
- On the dimension of twisted centralizer codes (Q2406673) (← links)
- Groupoids and Faà di Bruno formulae for Green functions in bialgebras of trees. (Q2445963) (← links)
