The following pages link to Thomas Britz (Q189835):
Displaying 50 items.
- Generalized Gray codes with prescribed ends (Q512653) (← links)
- An infinite self-dual Ramsey theorem (Q529218) (← links)
- Wei-type duality theorems for matroids (Q664380) (← links)
- Weighted Rogers-Ramanujan partitions and Dyson crank (Q721854) (← links)
- Wei-type duality theorems for rank metric codes (Q782848) (← links)
- Mutually orthogonal binary frequency squares (Q782946) (← links)
- A MacWilliams type identity for matroids (Q941399) (← links)
- Designs from subcode supports of linear codes (Q1008976) (← links)
- MacWilliams identities and matroid polynomials (Q1348850) (← links)
- Computing primary solutions of equations involving primary matrix functions (Q1625478) (← links)
- A new universal cycle for permutations (Q1696522) (← links)
- An upper bound on the minimal dispersion (Q1704610) (← links)
- (Q1886522) (redirect page) (← links)
- The Moore-Penrose inverse of matrices with an acyclic bipartite graph (Q1886523) (← links)
- Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs (Q2033928) (← links)
- A useful tool for constructing linear codes (Q2042936) (← links)
- Group divisible designs with block size 4 where the group sizes are congruent to 2 mod 3 (Q2065912) (← links)
- The energy of trees with diameter five under given conditions (Q2089173) (← links)
- \(\ell\)-connectivity, integrity, tenacity, toughness and eigenvalues of graphs (Q2091163) (← links)
- Extremal digraphs avoiding distinct walks of length 4 with the same endpoints (Q2151226) (← links)
- Nonsingular (vertex-weighted) block graphs (Q2185844) (← links)
- Improved upper bounds for parent-identifying set systems and separable codes (Q2220762) (← links)
- Non-trivial \(d\)-wise intersecting families (Q2221841) (← links)
- A further study on a nonlinear matrix equation (Q2227322) (← links)
- A spectral condition for odd cycles in non-bipartite graphs (Q2238862) (← links)
- Demi-matroids from codes over finite Frobenius rings (Q2339138) (← links)
- Maximal partial Latin cubes (Q2341074) (← links)
- Covering radii are not matroid invariants (Q2484374) (← links)
- On \(P\)-weight and \(P\)-distance inequalities (Q2488934) (← links)
- Extensions of the critical theorem (Q2581403) (← links)
- Minimum supports of eigenfunctions in bilinear forms graphs (Q2633614) (← links)
- Higher support matroids (Q2643325) (← links)
- Edge-connectivity matrices and their spectra (Q2668063) (← links)
- Group divisible designs with block size 4 where the group sizes are congruent to \(1 \bmod 3\) (Q2685311) (← links)
- Counting dope matrices (Q2685364) (← links)
- (Q2704227) (← links)
- On the Covering Dimension of a Linear Code (Q2976854) (← links)
- The Moore-Penrose inverse of a free matrix (Q3497887) (← links)
- The Higher Weight Enumerators of the Doubly-Even, Self-Dual $[48, 24, 12]$ Code (Q3548931) (← links)
- Designs from Matroids (Q3563961) (← links)
- Minimal Spectrally Arbitrary Sign Patterns (Q4650992) (← links)
- Matrix inversion and digraphs: the one factor case (Q4656562) (← links)
- Schur complements of matrices with acyclic bipartite graphs (Q4656584) (← links)
- On Mubayi's Conjecture and Conditionally Intersecting Sets (Q4684465) (← links)
- Code Enumerators and Tutte Polynomials (Q5281296) (← links)
- Quasi-Uniform Codes and Their Applications (Q5346198) (← links)
- The product formula for regularized Fredholm determinants (Q5855734) (← links)
- Codes (Q5889996) (← links)
- Finite posets and Ferrers shapes (Q5937633) (← links)
- The inverse of a non-singular free matrix (Q5955660) (← links)
