36 results on '"Bogart, Tristram"'
Search Results
2. An Ehrhart theoretic approach to generalized Golomb rulers
3. Numerical semigroups via projections and via quotients
4. When is a numerical semigroup a quotient?
5. Bounds on Determinantal Complexity of Two Types of Generalized Permanents
6. Complex psd-minimal polytopes in dimensions two and three
7. A Plethora of Polynomials: A Toolbox for Counting Problems
8. Constructing Partial MDS Codes from Reducible Curves
9. An Algebraic Approach to Projective Uniqueness with an Application to Order Polytopes
10. Periodic behavior in families of numerical and affine semigroups via parametric Presburger arithmetic
11. A parametric version of LLL and some consequences: parametric shortest and closest vector problems
12. An $\ell-p$ switch trick to obtain a new elementary proof of a criterion for arithmetic equivalence
13. Parametric Presburger Arithmetic: Complexity of Counting and Quantifier Elimination
14. Parametric Presburger arithmetic: logic, combinatorics, and quasi-polynomial behavior
15. A lower bound for the determinantal complexity of a hypersurface
16. Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count
17. Hom-polytopes
18. Enumeration of Golomb Rulers and Acyclic Orientations of Mixed Graphs
19. Obstructions to lifting tropical curves in surfaces in 3-space
20. Few smooth d-polytopes with n lattice points
21. Equality of Graver bases and universal Gr\'obner bases of colored partition identities
22. Small Chvatal rank
23. The Circuit Ideal of a Vector Configuration
24. Computing Tropical Varieties
25. An ℓ-p switch trick to obtain a new proof of a criterion for arithmetic equivalence
26. A Lower Bound for the Determinantal Complexity of a Hypersurface
27. Complex psd-minimal polytopes in dimensions two and three
28. Hom-polytopes
29. The circuit ideal of a vector configuration
30. An $$\ell -p$$ ℓ - p switch trick to obtain a new proof of a criterion for arithmetic equivalence
31. Parametric Presburger arithmetic: logic, combinatorics, and quasi-polynomial behavior
32. A Lower Bound for the Determinantal Complexity of a Hypersurface
33. An $$\ell -p$$ ℓ-p switch trick to obtain a new proof of a criterion for arithmetic equivalence
34. Universal Gröbner Bases of Colored Partition Identities
35. Enumeration of Golomb Rulers and Acyclic Orientations of Mixed Graphs
36. Hom-polytopes
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.