The following pages link to Tristram C. Bogart (Q1747994):
Displayed 22 items.
- Item:Q1747994 (redirect page) (← links)
- Enumeration of Golomb rulers and acyclic orientations of mixed graphs (Q456386) (← links)
- The circuit ideal of a vector configuration (Q875100) (← links)
- Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count (Q1747995) (← links)
- Hom-polytopes (Q1944801) (← links)
- An algebraic approach to projective uniqueness with an application to order polytopes (Q2117349) (← links)
- An \(\ell-p\) switch trick to obtain a new proof of a criterion for arithmetic equivalence (Q2316314) (← links)
- Finitely many smooth \(d\)-polytopes with \(n\) lattice points (Q2351749) (← links)
- A lower bound for the determinantal complexity of a hypersurface (Q2362290) (← links)
- Computing tropical varieties (Q2457408) (← links)
- Small Chvátal rank (Q2638380) (← links)
- Obstructions to Lifting Tropical Curves in Surfaces in 3-Space (Q4899044) (← links)
- Universal Gröbner Bases of Colored Partition Identities (Q4908505) (← links)
- Constructing Partial MDS Codes from Reducible Algebraic Curves (Q5020843) (← links)
- Complex psd-minimal polytopes in dimensions two and three (Q6089230) (← links)
- WHEN IS A NUMERICAL SEMIGROUP A QUOTIENT? (Q6151362) (← links)
- Equality of Graver bases and universal Gr\"obner bases of colored partition identities (Q6218364) (← links)
- Parametric Presburger Arithmetic: Complexity of Counting and Quantifier Elimination (Q6297283) (← links)
- Periodic behavior in families of numerical and affine semigroups via parametric Presburger arithmetic (Q6329589) (← links)
- Constructing Partial MDS Codes from Reducible Curves (Q6346102) (← links)
- Bounds on Determinantal Complexity of Two Types of Generalized Permanents (Q6392206) (← links)
- An Ehrhart theoretic approach to generalized Golomb rulers (Q6448157) (← links)