The following pages link to (Q3851094):
Displaying 50 items.
- Geometric properties of matrices induced by pattern avoidance (Q265055) (← links)
- On the completability of incomplete orthogonal Latin rectangles (Q267209) (← links)
- New duality operator for complex circulant matrices and a conjecture of Ryser (Q276213) (← links)
- A permanent formula with many zero-valued terms (Q287124) (← links)
- On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts (Q344930) (← links)
- The Bruhat rank of a binary symmetric staircase pattern (Q350324) (← links)
- Analytic aspects of the circulant Hadamard conjecture (Q397786) (← links)
- The expected characteristic and permanental polynomials of the random Gram matrix (Q405292) (← links)
- Evaluation of permanents in rings and semirings (Q407582) (← links)
- Arithmetic circuits: the chasm at depth four gets wider (Q442109) (← links)
- Sufficient conditions for a conjecture of Ryser about Hadamard circulant matrices (Q454829) (← links)
- Two-colorings with many monochromatic cliques in both colors (Q463286) (← links)
- Cycle-maximal triangle-free graphs (Q472981) (← links)
- On realizations of a joint degree matrix (Q479053) (← links)
- On the permanents of circulant and degenerate Schur matrices (Q512073) (← links)
- Solving the train marshalling problem by inclusion-exclusion (Q516904) (← links)
- Vector representations of graphs (Q584287) (← links)
- Algorithms for four variants of the exact satisfiability problem (Q596105) (← links)
- The complexity of computing the permanent (Q600247) (← links)
- On the Pólya permanent problem over finite fields (Q607375) (← links)
- New permanental bounds for Ferrers matrices (Q636241) (← links)
- Nonlinear PDEs and measure-valued branching type processes (Q638455) (← links)
- On two generalizations of the Alon-Tarsi polynomial method (Q651032) (← links)
- Reconstructing convex polyominoes from horizontal and vertical projections (Q672143) (← links)
- Triangular blocks of zeros in (0,1) matrices with small permanents (Q676040) (← links)
- Extended interlacing intervals (Q677914) (← links)
- Sign patterns that require repeated eigenvalues (Q686376) (← links)
- A combinatorial decomposition of acyclic simplicial complexes (Q687119) (← links)
- Optimality aspects of row-column designs with non-orthogonal structure (Q689406) (← links)
- Calculation of the permanent of a sparse positive matrix (Q709358) (← links)
- A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes (Q709589) (← links)
- An efficient algorithm for computing permanental polynomials of graphs (Q710005) (← links)
- The combinatorics of N. G. de Bruijn (Q740470) (← links)
- Bidimensional allocation of seats via zero-one matrices with given line sums (Q744674) (← links)
- Weight polarization and divisibility (Q751625) (← links)
- \((0,\lambda)\)-graphs and \(n\)-cubes (Q755594) (← links)
- On large sets of disjoint Steiner triple systems. VI (Q762162) (← links)
- The doubly stochastic matrices of a vector majorization (Q762582) (← links)
- New permanent approximation inequalities via identities (Q779828) (← links)
- Computing expectations and marginal likelihoods for permutations (Q782657) (← links)
- A faster tree-decomposition based algorithm for counting linear extensions (Q786030) (← links)
- Prime interchange graphs of classes of matrices of zeros and ones (Q787164) (← links)
- Über die Wurzelschranke für das Minimalgewicht von Codes (Q789375) (← links)
- An extremal problem on v-partite graphs (Q789407) (← links)
- Matrices and set differences (Q790122) (← links)
- Chromatic number of classes of matrices of zeros and ones (Q794654) (← links)
- The class of matrices of zeros, ones, and twos with prescribed row and column sums (Q803137) (← links)
- On graphic and 3-hypergraphic sequences (Q809101) (← links)
- Totally nonpositive completions on partial matrices (Q819143) (← links)
- Richardson-Gaudin geminal wavefunctions in a Slater determinant basis (Q830879) (← links)