The following pages link to (Q4002255):
Displaying 50 items.
- Finite state incompressible infinite sequences (Q259039) (← links)
- Maintaining transitive closure in first order after node-set and edge-set deletions (Q287062) (← links)
- On computing the number of Latin rectangles (Q293658) (← links)
- A class of cyclic \((v; k_{1}, k_{2}, k_{3}; \lambda)\) difference families with \(v \equiv 3\, (\text{mod}\, 4)\) a prime (Q325819) (← links)
- Constructions and bounds for mixed-dimension subspace codes (Q326349) (← links)
- \(\text{ALR}^n\): accelerated higher-order logistic regression (Q331666) (← links)
- Low-lying zeros of quadratic Dirichlet \(L\)-functions, hyper-elliptic curves and random matrix theory (Q359552) (← links)
- Hadamard tensors and lower bounds on multiparty communication complexity (Q371197) (← links)
- On the number of tilings of a square by rectangles (Q404384) (← links)
- Spectral hypergraph theory of the adjacency hypermatrix and matroids (Q471932) (← links)
- An upper bound on the number of high-dimensional permutations (Q485003) (← links)
- Proof of a conjectural supercongruence (Q492003) (← links)
- Inclusion of forbidden minors in random representable matroids (Q526240) (← links)
- Partition arguments in multiparty communication complexity (Q541668) (← links)
- Enumeration of viral capsid assembly pathways: tree orbits under permutation group action (Q542011) (← links)
- On \(J_{m}\)-Hadamard matrices (Q556423) (← links)
- How does Sudoku acquire integral eigenvalues? (Q601781) (← links)
- An equivalence of Ward's bound and its application (Q629876) (← links)
- An invariant for matrices and sets of points in prime characteristic (Q629937) (← links)
- New Nordhaus-Gaddum-type results for the Kirchhoff index (Q645165) (← links)
- Random planar graphs with bounds on the maximum and minimum degrees (Q659667) (← links)
- New recurrence algorithms for the nonclassic Adomian polynomials (Q662210) (← links)
- Conditions for the existence of spreads in projective Hjelmslev spaces (Q670201) (← links)
- Spreads in strongly regular graphs (Q677166) (← links)
- New families of graphs without short cycles and large size (Q708348) (← links)
- The permanent of a square matrix (Q709260) (← links)
- Finite state complexity (Q719308) (← links)
- A \((0,1)\)-matrix existence theorem and equivalent tiling problems with dimers and monomers (Q745216) (← links)
- Some colouring problems for Paley graphs (Q817760) (← links)
- Statistics for phylogenetic trees (Q849456) (← links)
- Combinatorics of counting finite fuzzy subsets (Q853462) (← links)
- \(r\)-strong edge colorings of graphs (Q856841) (← links)
- 5-chromatic strongly regular graphs (Q856856) (← links)
- Probabilistic extensions of the Erdős-Ko-Rado property (Q861532) (← links)
- The limitations of nice mutually unbiased bases (Q871276) (← links)
- Hadwiger's conjecture for powers of cycles and their complements (Q875052) (← links)
- A characterization of Delsarte's linear programming bound as a ratio bound (Q876308) (← links)
- Gray code for permutations with a fixed number of cycles (Q879329) (← links)
- Coloring the square of graphs whose maximum average degree is less than 4 (Q906469) (← links)
- Regular LDPC codes from semipartial geometries (Q925272) (← links)
- Clique partitions of distance multigraphs (Q932596) (← links)
- Vertex coloring acyclic digraphs and their corresponding hypergraphs (Q944747) (← links)
- Lower bounds for the transition complexity of NFAs (Q955341) (← links)
- A Kruskal-Katona type theorem for graphs (Q966066) (← links)
- Pólya distributions, combinatorial identities, and generalized stirling numbers (Q997723) (← links)
- More on pooling spaces (Q998372) (← links)
- Approximating reals by sums of rationals (Q999710) (← links)
- Designs from subcode supports of linear codes (Q1008976) (← links)
- Ring geometries, two-weight codes, and strongly regular graphs (Q1009016) (← links)
- Decimations of languages and state complexity (Q1019721) (← links)
