105 results on '"Bogart, Tristram"'
Search Results
2. Numerical Semigroups via Projections and via Quotients
3. An Ehrhart theoretic approach to generalized Golomb rulers
4. Numerical semigroups via projections and via quotients
5. When is a numerical semigroup a quotient?
6. Bounds on Determinantal Complexity of Two Types of Generalized Permanents
7. Complex psd-minimal polytopes in dimensions two and three
8. A Plethora of Polynomials: A Toolbox for Counting Problems
9. Constructing Partial MDS Codes from Reducible Curves
10. An Algebraic Approach to Projective Uniqueness with an Application to Order Polytopes
11. Periodic behavior in families of numerical and affine semigroups via parametric Presburger arithmetic
12. A parametric version of LLL and some consequences: parametric shortest and closest vector problems
13. An $\ell-p$ switch trick to obtain a new elementary proof of a criterion for arithmetic equivalence
14. Parametric Presburger Arithmetic: Complexity of Counting and Quantifier Elimination
15. An Algebraic Approach to Projective Uniqueness with an Application to Order Polytopes
16. Parametric Presburger arithmetic: logic, combinatorics, and quasi-polynomial behavior
17. Periodic behavior in families of numerical and affine semigroups via parametric Presburger arithmetic
18. A lower bound for the determinantal complexity of a hypersurface
19. Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count
20. Hom-polytopes
21. Enumeration of Golomb Rulers and Acyclic Orientations of Mixed Graphs
22. Obstructions to lifting tropical curves in surfaces in 3-space
23. Few smooth d-polytopes with n lattice points
24. Equality of Graver bases and universal Gr\'obner bases of colored partition identities
25. WHEN IS A NUMERICAL SEMIGROUP A QUOTIENT?
26. Complex psd-minimal polytopes in dimensions two and three.
27. Small Chvatal rank
28. The Circuit Ideal of a Vector Configuration
29. Computing Tropical Varieties
30. Superlinear Subset Partition Graphs With Dimension Reduction, Strong Adjacency, and Endpoint Count
31. WHEN IS A NUMERICAL SEMIGROUP A QUOTIENT?
32. An ℓ-p switch trick to obtain a new proof of a criterion for arithmetic equivalence
33. Complex psd-minimal polytopes in dimensions two and three
34. A Lower Bound for the Determinantal Complexity of a Hypersurface
35. Riffs on the Infinite Ping-Pong Ball Conundrum
36. Finitely many smooth d-polytopes with n lattice points
37. A Plethora of Polynomials: A Toolbox for Counting Problems
38. An Algebraic Approach to Projective Uniqueness with an Application to Order Polytopes
39. Hom-polytopes
40. Small Chvátal Rank
41. Constructing Partial MDS Codes from Reducible Algebraic Curves
42. The circuit ideal of a vector configuration
43. A Parametric Version of LLL and Some Consequences: Parametric Shortest and Closest Vector Problems
44. Parametric Presburger arithmetic: complexity of counting and quantifier elimination
45. An $$\ell -p$$ ℓ - p switch trick to obtain a new proof of a criterion for arithmetic equivalence
46. Superlinear Subset Partition Graphs With Dimension Reduction, Strong Adjacency, and Endpoint Count
47. Parametric Presburger arithmetic: logic, combinatorics, and quasi-polynomial behavior
48. A Lower Bound for the Determinantal Complexity of a Hypersurface
49. An $$\ell -p$$ ℓ-p switch trick to obtain a new proof of a criterion for arithmetic equivalence
50. The Circuit Ideal of a Vector Configuration
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.