|
|||||
 |
|
|
|
|
|
|
|
Vol. 18, No. 2, 2025 |
|
Contents
|
|
Spectral distortion and the
ring learning with errors problem
181–198
Liljana Babinkostova, Ariana G. Chin, Aaron Kirtland, Vladyslav Nazarchuk and Esther Plotnick |
|
Links in projective planar
graphs
199–238
Joel Foisy, Luis Ángel Topete Galván, Evan Knowles, Uriel Alejandro Nolasco, Yuanyuan Shen and Lucy Wickham |
|
Classical solutions of the
Fornberg–Whitham equation
239–260
Georgia Burkhalter, Ryan C. Thompson and Madison Waldrep |
|
Every graph with maximum
degree at most four is $(1^1,2^{19})$-packing edge-colorable
and $(1^2,2^{17})$-packing edge-colorable
261–282
Cicely Henderson, Camille Kennedy and Michael Santana |
|
On the epidemic threshold
of a network
283–296
Vadym Cherniavskyi, Gabriel Dennis and S. R. Kingan |
|
Reversed Dickson
polynomials
297–328
Jiaqi Fang, Neranga Fernando and Haoming Wu |
|
Influences of some families
of error-correcting codes
329–349
Hailey Egan, Jason T. LeGrow, Gretchen L. Matthews and Jeff Suliga |
|
Application of adaptive
$c$-optimal design for benchmark dose estimation
351–361
Marleen Barron and Steven Kim |
|
A note on heights of
cyclotomic polynomials
363–372
Gennady Bachman, Christopher Bao and Shenlone Wu |
|
Continued fractions and
lines across the Stern–Brocot diagram
373–385
Heather Abramson, Eric Chesebro, Vivian Cummins, Cory Emlen, Ryan Grady and Kenton Ke |
