37 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. WHEN IS A NUMERICAL SEMIGROUP A QUOTIENT?
21. Complex psd-minimal polytopes in dimensions two and three.
22. Superlinear Subset Partition Graphs With Dimension Reduction, Strong Adjacency, and Endpoint Count
23. WHEN IS A NUMERICAL SEMIGROUP A QUOTIENT?
24. An ℓ-p switch trick to obtain a new proof of a criterion for arithmetic equivalence
25. Complex psd-minimal polytopes in dimensions two and three
26. A Lower Bound for the Determinantal Complexity of a Hypersurface
27. Finitely many smooth d-polytopes with n lattice points
28. A Plethora of Polynomials: A Toolbox for Counting Problems
29. An Algebraic Approach to Projective Uniqueness with an Application to Order Polytopes
30. Constructing Partial MDS Codes from Reducible Algebraic Curves
31. A Parametric Version of LLL and Some Consequences: Parametric Shortest and Closest Vector Problems
32. Parametric Presburger arithmetic: complexity of counting and quantifier elimination
33. An $$\ell -p$$ ℓ - p switch trick to obtain a new proof of a criterion for arithmetic equivalence
34. Superlinear Subset Partition Graphs With Dimension Reduction, Strong Adjacency, and Endpoint Count
35. Parametric Presburger arithmetic: logic, combinatorics, and quasi-polynomial behavior
36. A Lower Bound for the Determinantal Complexity of a Hypersurface
37. An $$\ell -p$$ ℓ-p switch trick to obtain a new proof of a criterion for arithmetic equivalence
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.