Adam Boocher
University of California, Berkeley
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Adam Boocher.
Experimental Mathematics | 2009
Adam Boocher; Jay Daigle; Jim Hoste; Wenjing Zheng
A Lissajous knot is one that can be parameterized as , where the frequencies n x , n y , and n z are relatively prime integers and the phase shifts ϕ x , ϕ y , and ϕ z are real numbers. Lissajous knots are highly symmetric, and for this reason, not all knots are Lissajous. We prove several theorems that allow us to place bounds on the number of Lissajous knot types with given frequencies and to efficiently sample all possible Lissajous knots with a given set of frequencies. In particular, we systematically tabulate all Lissajous knots with small frequencies and as a result substantially enlarge the tables of known Lissajous knots. A Fourier-(i, j, k) knot is similar to a Lissajous knot except that the x, y, and z coordinates are now each described by a sum of i, j, and k cosine functions, respectively. According to Lamm, every knot is a Fourier-(1, 1, k) knot for some k. By randomly searching the set of Fourier-(1, 1, 2) knots we find that all 2-bridge knots with up to 14 crossings are either Lissajous or Fourier-(1, 1, 2) knots. We show that all twist knots are Fourier-(1, 1, 2) knots and give evidence suggesting that all torus knots are Fourier-(1, 1, 2) knots. As a result of our computer search, several knots with relatively small crossing numbers are identified as potential counterexamples to interesting conjectures.
Annals of Combinatorics | 2015
Adam Boocher; Bryan Brown; Timothy Duff; Laura Lyman; Takumi Murayama; Amy Nesky; Karl Schaefer
Let I be a toric ideal. We say I is robust if its universal Gröbner basis is a minimal generating set. We show that any robust toric ideal arising from a graph G is also minimally generated by its Graver basis. We then completely characterize all graphs which give rise to robust ideals. Our characterization shows that robustness can be determined solely in terms of graph-theoretic conditions on the set of circuits of G.
Le Matematiche | 2015
Adam Boocher; Alessio D'Alì; Eloísa Grifo; Jonathan Montaño; Alessio Sammartano
Let
Linear Algebra and its Applications | 2008
Adam Boocher; Bradley Froehle
R= S/I
arXiv: Commutative Algebra | 2017
Adam Boocher; S. Hamid Hassanzadeh; Srikanth B. Iyengar
where
arXiv: Commutative Algebra | 2016
Adam Boocher; Alessio D’Alì; Eloísa Grifo; Jonathan Montaño; Alessio Sammartano
S=k[T_1, \ldots, T_n]
Canadian Journal of Mathematics | 2010
Adam Boocher; Michael Daub; Ryan K. Johnson; H. Lindo; S. Loepp; Paul A. Woodard
and
Communications in Algebra | 2009
Adam Boocher; Michael Daub; S. Loepp
I
Mathematical Research Letters | 2012
Adam Boocher
is a homogeneous ideal in
Journal of Algebraic Combinatorics | 2016
Federico Ardila; Adam Boocher
S