202324 Department of Mathematics Events 

July, 2024 
Wednesday 
Ph. D. Defense Speaker: David Blessing, Ph. D. Candidate Advisor: Dr. Jason MirelesJames Title: Parameterization of Invariant Circles in Maps Abstract: We explore a novel method of approximating topologically trivial invariant circles in area preserving maps. The process begins by leveraging improvements on Birkhoff’s Ergodic Theorem via Weighted Birkhoff Averages to compute high precision estimates on several Fourier modes. We then set up a Newtonlike iteration to further improve the estimation and extend the approximation out to a sufficient number of modes to yield a significant decay in the magnitude of the coefficients of high order. With this approximation in hand, we explore the phase space near the approximate invariant circle with a form numerical continuation where the rotation number is perturbed and the process is repeated. Then, we turn our attention to a completely different problem which can be approached in a similar way to the numerical continuation, finding a Siegel disk boundary in a holomorphic map. Given a holomorphic map which leads to a formally solvable cohomological equation near the origin, we use a numerical continuation style process to approximate an invariant circle in the Siegel disk near the origin. Using an iterative scheme, we then enlarge the invariant circle so that it approximates the boundary of the Siegel disk. Join Zoom Meeting: https://fauedu.zoom.us/j/86001628559?pwd=eKBGhnaXIOpeF9YbyibI9qqMUUon7T.1 Meeting ID: 860 0162 8559 All are cordially invited. 
Thursday 
Analysis and Algebra Seminar Speaker: Parker Edwards, Assistant Professor Title: On computing local monodromy Abstract: A fundamental fact about zero sets of systems of polynomial equations over the complex numbers is that they decompose into a finite number of irreducible algebraic subsets. Knowing a thorough description of the irreducible components of an algebraic variety tells you quite a bit about it, and computing one is an essential preprocessing step to many numerical algorithms. Standard algorithms for computing this numerical irreducible decomposition combine some relatively sophisticated machinery. A main component is computing the monodromy action of certain linear projection maps using numerical continuation. What if one is instead interested in studying the geometric properties of an algebraic variety localized at a point? This puts you into the realm of singularity theory in complex analytic geometry, which is a rich and ongoing area of theoretical development. Every zero set of a system of complexvalued analytic functions has a local irreducible decomposition at each point. Computing a corresponding numerical local irreducible decomposition is similarly essential to developing a local approach to numerical algebraic geometry. I will discuss some recent work with Jon Hauenstein which culminates in an algorithm for doing so. My aim for these seminars is to give a thorough enough overview of the background to understand what the algorithm is doing. If there's interest, we can discuss enough to get at the main ideas of the proof that it works. Here's the breakdown:

Thursday 
Analysis and Algebra Seminar Speaker: Parker Edwards, Assistant Professor Title: On computing local monodromy (part II) Abstract: A fundamental fact about zero sets of systems of polynomial equations over the complex numbers is that they decompose into a finite number of irreducible algebraic subsets. Knowing a thorough description of the irreducible components of an algebraic variety tells you quite a bit about it, and computing one is an essential preprocessing step to many numerical algorithms. Standard algorithms for computing this numerical irreducible decomposition combine some relatively sophisticated machinery. This week's talk will cover some background on monodromy actions and how they're used to detect irreducible components of algebraic varieties. A main component is computing the monodromy action of certain linear projection maps using numerical continuation.
What if one is instead interested in studying the geometric properties of an algebraic variety localized at a point? This puts you into the realm of singularity theory in complex analytic geometry, which is a rich and ongoing area of theoretical development. Every zero set of a system of complexvalued analytic functions has a local irreducible decomposition at each point. Computing a corresponding numerical local irreducible decomposition is similarly essential to developing a local approach to numerical algebraic geometry.
I will discuss some recent work with Jon Hauenstein which culminates in an algorithm for doing so. My aim for these seminars is to give a thorough enough overview of the background to understand what the algorithm is doing. If there's interest, we can discuss enough to get at the main ideas of the proof that it works. Here's the breakdown:

Wednesday 
PhD Dissertation Defense Speaker: Abhraneel Dutta, Ph.D. Candidate; Florida Atlantic University Advancements in Cryptographic Efficiency: Elliptic Curve Scalar Multiplication and ConstantTime Polynomial Inversion in PostQuantum Cryptography Advisor: Dr. Edoardo Persichetti CoAdvisor: Dr. Koray Karabina Abstract: An efficient scalar multiplication algorithm is vital for elliptic curve cryptosystems. The first part of this dissertation focuses on a scalar multiplication algorithm based on scalar recodings resistant to timing attacks. The algorithm utilizes two recoding methods: Recode, which generalizes the nonzero signed allbit set recoding, and Align, which generalizes the signaligned columns recoding. For an ℓbit scalar split into d subscalars, our algorithm has a computational cost of ⌈⌈ℓ log_k(2)⌉/d⌉ point additions and kscalar multiplications and a storage cost of k^(d−1) (k − 1) − 1 points on E. The “split and comb” method further optimizes computational and storage complexity. We find the best setting to be with a fixed base point on a Twisted Edwards curve using a mix of projective and extended coordinates, with k = 2 generally offering the best performance. However, k = 3 may be better in certain applications. The second part of this dissertation is dedicated to constanttime polynomial inversion algorithms in PostQuantum Cryptography (PQC). The computation of the inverse of a polynomial over a quotient ring or finite field is crucial for key generation in postquantum cryptosystems like NTRU, BIKE, and LEDACrypt. Efficient algorithms must run in constant time to prevent sidechannel attacks. We examine constanttime algorithms based on Fermat’s Little Theorem and the Extended GCD Algorithm, providing detailed time complexity analysis. We find that the constanttime Extended GCD inversion algorithm is more efficient, performing fewer field multiplications. Additionally, we explore other exponentiation algorithms similar to the ItohTsuji inversion method, which optimizes polynomial multiplications in the BIKE/LEDACrypt setup. Recent results on hardware implementations are also discussed. Please contact Dr. Hongwei Long <hlong@fau.edu> for an electronic copy of the dissertation. Zoom Meeting Information: https://fauedu.zoom.us/j/84701837030?pwd=Sh4fqdX7iPRXAXWUqazvFWLijZ3A9u.1 
Thursday 
Analysis and Algebra Seminar Speaker: Parker Edwards, Assistant Professor Title: On computing local monodromy (part III) Abstract: A fundamental fact about zero sets of systems of polynomial equations over the complex numbers is that they decompose into a finite number of irreducible algebraic subsets. Knowing a thorough description of the irreducible components of an algebraic variety tells you quite a bit about it, and computing one is an essential preprocessing step to many numerical algorithms. Standard algorithms for computing this numerical irreducible decomposition combine some relatively sophisticated machinery. This week's talk will cover some background on monodromy actions and how they're used to detect irreducible components of algebraic varieties. A main component is computing the monodromy action of certain linear projection maps using numerical continuation. What if one is instead interested in studying the geometric properties of an algebraic variety localized at a point? This puts you into the realm of singularity theory in complex analytic geometry, which is a rich and ongoing area of theoretical development. Every zero set of a system of complexvalued analytic functions has a local irreducible decomposition at each point. Computing a corresponding numerical local irreducible decomposition is similarly essential to developing a local approach to numerical algebraic geometry. I will discuss some recent work with Jon Hauenstein which culminates in an algorithm for doing so. My aim for these seminars is to give a thorough enough overview of the background to understand what the algorithm is doing. If there's interest, we can discuss enough to get at the main ideas of the proof that it works. Here's the breakdown:


June, 2024 
Friday 
Society for Industrial and Applied Mathematics (SIAM) FAU Student Chapter The SIAM officers will use part of the time to reflect on what SIAM has done in the past year and discuss future plans for the upcoming Fall and Spring semesters. Even if you have not attended a previous SIAM meeting, please join us to enjoy light refreshments and food with other graduate students and learn more about SIAM and how you can get involved. No need to RSVP, all are welcome! If you have any questions, feel free to let us know by sending us an email or reaching out to the SIAM faculty advisor, Dr. Francis Motta fmotta@fau.edu. 

May, 2024 
Wednesday 
MS Exam (Presentation) Speaker: Nathan Blood, MS Candidate Title: Analysis of the Stability of HIV SIR Models Abstract: Using a Susceptible, Infected, and Recovered (SIR) model for spread of HIV, we determine conditions for a reproduction number which determine the circumstances for stability of the infected class. All are cordially invited. 
Thursday 
Analysis and Applications Seminar This week in the Analysis and Applications Seminar, Dr. Jason MirelesJames will give the second of two or three talks which will continue for the next few weeks. Speaker: Dr. Jason MirelesJames Title: A stable manifold theorem for delay maps (part II) Abstract: I will go over the proof of a stable manifold theorem which can be applied to a class of delay maps (and to compositions of these maps). At the fixed points I would like to consider, there are finitely many unstable and center eigenvalues, and countably many stable eigenvalues accumulating to zero. The presence of center directions effects the setup of the proof. Also, the goal is to apply this stable manifold theorem in constructive computer assisted proofs. Because if this, you don't want to assume that the map is completely diagonalized. This also requires adjusting standard arguments. I will be careful to obtain not only explicit bounds on the location of the stable manifold (which is infinite dimensional), but also explicit bounds on Lipschitz constants of the derivatives. I will start with some basic discussion of delay maps, including the reason for the appearance of center directions. Indeed, at some moment it will be important to count exactly the number of eigenvalues on the unit circle, and to work out formulas for their eigenfunctions. Another facet of the discussion is that, to obtain the regularity results, I'll use a very nice theorem due to Lanford which partially extends the ArzelaAscoli theorem to families of functions defined on Banach spaces (i.e. to functions with noncompact domain and range). I think it would be nice to work through the proof of Lanford's theorem, and this will be the content of the third (fourth?) talk in this little series.

Saturday May, 11 
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 23, 2023. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! Register Here for Fall, 2024 Math Circles 
Wednesday 
Analysis and Applications/Colloquium Speaker: Dr. Matt Holzer, Mathematical Sciences, George Mason University Title: Pushed and pulled invasion fronts in parabolic PDEs Absract: Invasion fronts refer to fronts that propagate into unstable states. This talk will provide a review of some of the theoretical aspects of invasion fronts and discuss current research efforts. These fronts are often categorized as pushed or pulled and the talk will cover theoretical and numerical aspects of locating these fronts and identifying their speeds as well as their relevance to applications. All are welcome!


April, 2024 
Monday 
Join the faculty and students of Cryptography for a biweekly reading seminar on multiparty computations. 
Wednesday 
Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! 
Thursday 
Analysis and Applications Seminar Speaker : J.P. Lessard, McGill University Title : Computerassisted proofs for differential equations with nonpolynomial nonlinearities via the FFT. Abstract : This presentation introduces a methodology for generating computerassisted proofs (CAPs) establishing the existence of solutions for nonlinear differential equations with nonpolynomial analytic nonlinearities. Our approach integrates the Fast Fourier Transform (FFT) algorithm with interval arithmetic and a NewtonKantorovich argument to construct CAPs effectively. Notably, to rigorously manage the Fourier coefficients of the nonlinear term Fourier series, we leverage insights from complex analysis and the Discrete Poisson Summation Formula. We showcase the applicability of our method through two examples: firstly, verifying the existence of periodic orbits in the MackeyGlass (delay) equation, and secondly, proving the existence of periodic localized traveling waves in the twodimensional suspension bridge equation. 
Saturday 
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 23, 2023. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! Register Here for Fall, 2024 Math Circles 
Monday 
Speaker : Dr. Francesco Sica, Assistant Professor, Florida Atlantic University +Zoom (click here) Title : Acceleration of multiscalar multiplication for zkSNARKs FLYER Abstract : The main computational bottleneck in the implementation of zeroknowledge succinct arguments of knowledge (zkSNARKs) based on elliptic curves, such as Pinocchio, is the evaluation (called multiscalar multiplication) $∑_{i=}$ 
Monday 
MS Presentation Speaker: Francis Boateng, MS Candidate Title: Influencing UnderFive Mortality in RuralUrban Ghana: An Applied Survival Analysis Abstract: In this presentation, we explore the application of the Breslow Method for Ties in analyzing survival probability, utilizing data from the 2014 Ghana Demographic and Health Survey (GDHS). Focusing on Ghana's rural and urban contexts, we investigate the socioeconomic and demographic factors influencing underfive mortality. This approach assumes a constant hazard function within each interval between event times. Our findings highlight maternal age, mother's education, household wealth index quintile, place of delivery, and birth order as significant determinants of child survival in Ghana. Moreover, the influence of these determinants varies between urban and rural settings. The study sheds light on the nuanced dynamics shaping child survival outcomes, contributing to understanding health disparities across different socioeconomic contexts. All are cordially invited. 
Monday 
SIAM Meeting (FAU Student Chapter) SIAM (Society for Industrial and Applied Mathematics) fosters the development of applied mathematical and computational methodologies needed in various application areas. Applied mathematics, in partnership with computational science, is essential in solving many realworld problems. Through publications, research, and community, the mission of SIAM is to build cooperation between mathematics and the worlds of science and technology. We hope to see you there! 
Thursday 
Analysis and Applications Seminar Speaker: Joan Gimeno, Universitat de Barcelona Title: New Solutions from Functional Perturbed Uniformly Hyperbolic Trajectories
Abstract: We develop a method to construct solutions of some (retarded or advanced) equations. We assume that the equations considered are formally close to an ODE and that the ODE admits hyperbolic solutions (that is, perturbations This is a joint work with R. de la Llave and J. Yang. 
Thursday 
Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! 
Friday 
Complex Analysis and Nonlinear Dynamic colloquium Speaker: Alex Stokolos, Georgia Southern University Title: Geometric complex analysis and cycles detection in nonlinear dynamics Abstract: In the talk, I will discuss a remarkable connection between the problem of long cycles detection in nonlinear autonomous dynamical systems and geometric complex analysis. The presentation will be accessible to everyone who took a standard Complex Analysis course. 
Saturday 
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 23, 2023. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! Register Here for Fall, 2024 Math Circles 
Monday 
Join the faculty and students of Cryptography for a biweekly reading seminar on multiparty computations. 
Wednesday 
Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! 
Thursday 
MS Presentation MS Candidate: Fatemeh Fogh Title: Parametrization Method for Stable and Unstable Manifolds for Studying Fixed Points Abstract: Utilizing a parametric representation of the stable and unstable manifolds, we demonstrate that for certain parameter values (specifically in the scenario initially explored by Hénon), the Hénon mapping exhibits a transversal homoclinic orbit. All are cordially invited 
Sunday 
Association for Women in Mathematics (FAU Student Chapter) presents Florida Women in Math Day 2024 All genders, backgrounds, and ages are welcome to attend and present at Florida Women in Math Day! Come and enjoy a career panel student posters a scavenger hunt and FREE Breakfast, lunch, and refreshments! FLYER for more information. 
Tuesday 
Ph.D. Dissertation Defense Speaker: Dominic Gold, Ph.D. candidate Advisor: Dr. Francis Motta Title: PrivacyPreserving Topological Data Analysis Using Homomorphic Encryption Abstract: Computational tools grounded in algebraic topology, known collectively as topological data analysis (TDA), have been used for dimensionalityreduction to preserve salient and discriminating features in data. This faithful but compressed representation of data through TDA's flagship method, persistent homology (PH), motivates its use to address the complexity, depth, and inefficiency issues present in privacypreserving, homomorphic encryption (HE)based machine learning (ML) models, which permit a data provider (often referred to as the Client) to outsource computational tasks on their encrypted data to a computationallysuperior but semihonest party (the Server). This work introduces efforts to adapt the wellestablished TDAML pipeline on encrypted data to realize the benefits TDA can provide to HE's computational limitations as well as provide HE's provable security on the sensitive data domains in which TDA has found success in (e.g., sequence, gene expression, imaging). The privacyprotecting technologies which could emerge from this foundational work will lead to direct improvements to the accessibility and equitability of health care systems. ML promises to reduce biases and improve accuracies of diagnoses, and enabling such models to act on sensitive biomedical data without exposing it will improve trustworthiness of these systems. To adapt the beginning steps of the TDAML pipeline, we create an HEcompatible arithmetic circuit of the fundamental map to compute PH on an encrypted boundary matrix for further use in downstream model development (with a complete construction, parameter selection guarantees, and error analysis). We achieve this by modifying the logical structure of the map and by developing new arithmetic circuits to replace its computational and conditional statements. We also show work in adapting the terminal steps of the TDAML pipeline to realize the boons TDA affords HEML models on the MNIST digits dataset using a logistic regression (LR) classifier. We demonstrated that the TDA methods chosen improve encrypted model inference with a 1025 fold reduction in amortized time while improving model accuracy up to 1.4% compared to naive reductions that used downscaling/resizing, and we show the first steps in realizing these same improvements on encrypted model training. Please contact Dr. Hongwei Long for an electronic copy of the dissertation. Zoom Meeting link: https://fauedu.zoom.us/my/dgold2012?omn=81121210837 All are cordially invited. 
Wednesday 
Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! 
Thursday 
Analysis and Applications Seminar This week in the Analysis and Applications Seminar, Dr. Jason MirelesJames will give the first of two or three talks which will continue for the next few weeks. Speaker: Dr. Jason MirelesJames Title: A stable manifold theorem for delay maps (part I) Abstract: I will go over the proof of a stable manifold theorem which can be applied to a class of delay maps (and to compositions of these maps). At the fixed points I would like to consider, there are finitely many unstable and center eigenvalues, and countably many stable eigenvalues accumulating to zero. The presence of center directions effects the setup of the proof. Also, the goal is to apply this stable manifold theorem in constructive computer assisted proofs. Because if this, you don't want to assume that the map is completely diagonalized. This also requires adjusting standard arguments. I will be careful to obtain not only explicit bounds on the location of the stable manifold (which is infinite dimensional), but also explicit bounds on Lipschitz constants of the derivatives. I will start with some basic discussion of delay maps, including the reason for the appearance of center directions. Indeed, at some moment it will be important to count exactly the number of eigenvalues on the unit circle, and to work out formulas for their eigenfunctions. Another facet of the discussion is that, to obtain the regularity results, I'll use a very nice theorem due to Lanford which partially extends the ArzelaAscoli theorem to families of functions defined on Banach spaces (i.e. to functions with noncompact domain and range). I think it would be nice to work through the proof of Lanford's theorem, and this will be the content of the third (fourth?) talk in this little series. These will be ``working'' talks, so constructive criticism/comments/questions are really helpful. 
Saturday 
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 23, 2023. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! Register Here for Fall, 2024 Math Circles 

March 2024 
Saturday 
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 23, 2023. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! Register Here for Fall, 2024 Math Circles 
March 48 
Fiftyfifth Southeastern International Conference on Combinatorics, Graph Theory, and Computing
For more information, please contact Dr. Maria Provost: mprovost@fau.edu 
Saturday 
FAU Math Day  Register Here!
Speaker: Dr. Francis Motta, Florida Atlantic University Title: Unveiling Nature's Mysteries: Exploring the Intersection of Math and Biology Abstract: Mathematics is built on logic and proof, while biology is an observational science; there's no proof, only evidence. So, what can mathematicians do to help biologists and vice versa? Join us on a journey where mathematics meets biology that reveals the profound synergy between these seemingly disparate fields. From understanding the curious and elegant patterns in nature's designs, to developing ways to use principles of life to tackle fundamentally important questions in human health, mathematical thinking is needed to elucidate fascinating observations about living things, now more than ever. From predicting how quickly an infectious disease will move through a population, to designing neverbeforeseen proteins that perform specific functions, to explaining the complex dance of biological molecules underlying many dynamic phenomena. In this talk we'll showcase the power of the language of mathematics to describe and decode some of the mysteries of the natural world. We will also highlight exciting new opportunities at Florida Atlantic University to study the burgeoning science at the intersection of mathematics and biology as we embark on a mathematical exploration to illuminate the beauty and complexity of life itself. 
Monday 
Speaker: Jason LeGrow, Assistant Professor, Virginia Tech Title: PostQuantum Blind Signatures from Group Actions Abstract: Blind signatures are a kind of cryptographic scheme which allows a User to receive a Signer’s signature on a message, in such a way that the message is not revealed to the Signer. Blind signatures can be used in many applications, such as a electronic voting and anonymous purchasing. To resist attacks by quantum computers, we must design blind signature schemes based on computational problems which are believed to be hard for quantum computers: socalled postquantum protocols. I will discuss techniques for constructing postquantum blind signatures from cryptographic group actions in the setting of isogenybased cryptography and codebased cryptography. 
Thursday 
Analysis and Applications Seminar Speaker: Adam Zaidan, Florida Atlantic University Title: Parameterization Methods for Delay Maps Abstract: This presentation will cover computational methods to parameterize invariant sets for a class of delaydifferential equations that can be transformed into infinitedimensional compact maps on Banach spaces. Specifically, we will study the dynamics of these maps and cover algorithms to approximate invariant sets such as invariant circles and unstable manifolds associated with fixed points and invariant circles. The parameterization methods will take the form of rootfinding problems in infinitedimensional Banach spaces, allowing us to use Newton's method to find numerical approximations of these invariant sets. The compactness of these delay maps allows us to easily implement these methods on a computer. Implementations of these parameterization methods are done in the Julia language. 
Thursday 
Pi Day Join the Department of Mathematics and Statistics for Pi Day! This annual celebration of Pi will feature a contest for Pi memorization, fun games, discussions about pi, food, refreshments, and of course, and lots of pie eating! We hope to see you there! FLYER 
Saturday March 16 
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 23, 2023. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! Register Here for Fall, 2024 Math Circles 
Monday 
Join the faculty and students of Cryptography for a biweekly reading seminar on multiparty computations. 
Wednesday 
Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! 
Monday 
Speaker: Xinxin Fan, IoTeX Title : ZeroKnowledge Proofs  An Industry Perspective Abstract : Driven by the rapid growth of blockchain and web3, zeroknowledge proofs have gained considerable development during the past few years. In this talk, I will give a stateoftheart overview of zeroknowledge proofs and their potential use cases from an industry perspective and highlight a number of research challenges that need to be further investigated. Bio: Dr. Xinxin Fan is the Head of Cryptography at IoTeX, a Silicon Valleybased technology platform that empowers the emerging machine economy with innovative combination of blockchain and IoT. He is responsible for directing the company’s strategy and product roadmaps as well as developing the core technologies and IP portfolio. Before joining IoTeX, he was a senior research engineer of the Security and Privacy Group at Bosch Research Technology Center North America. Dr. Xinxin Fan received his Ph.D. in Electrical and Computer Engineering from the University of Waterloo in 2010. He has published 60+ referred research papers in toptier journals, conferences and workshops in the areas of cryptography and information security and is an inventor of 17 patent filings for innovative information security and privacyenhancing technologies. He is also a Certified Information Systems Security Professional (CISSP) from (ISC)^2 and a (co)chair of IEEE P2418.1 and IEEE P2958 standards working groups. 
Thursday 
Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! 
Saturday March 30 
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 23, 2023. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! Register Here for Fall, 2024 Math Circles 

February, 2024 
Monday

Join the faculty and students of Cryptography for a biweekly reading seminar on multiparty computations. 
Thursday 
Candidate, Data Science in Statistics Speaker: Dr. Ruiyang Wu, Data Science in Statistics (candidate for a faculty position) Title: DDACSpAM: A Distributed Algorithm for Fitting Highdimensional Sparse Additive Models with Feature Division and Decorrelation Abstract: Distributed statistical learning has become a popular technique for analyzing largescale data. While most existing methods often divide observations, this strategy can be less effective under highdimensional settings where observations are relatively scarce. In this talk, I will introduce a new DDACSpAM algorithm tailored for highdimensional sparse additive models by dividing features instead of observations. Our method comprises three stages: divide, decorrelate, and conquer. The pivotal component, the decorrelation step, enables local estimators to recover the sparsity pattern for each additive component without stringent constraints on the correlation structure among variables. The effectiveness and efficacy of DDACSpAM are illustrated through theoretical analysis and empirical evidence from synthetic and real datasets. The theoretical results include consistent recovery of sparsity patterns (sparsistency) and statistical inference for each additive functional component. The DDACSpAM algorithm offers a practical approach for fitting sparse additive models, showing great potential for a wide range of applications. Open to faculty, staff, and students. 
Thursday 
Candidate, Cryptography Speaker: Dr. Vincenzo Lavorante, Cryptography (candidate for a faculty position) Title: Codebased Cryptography and symmetric Cryptography via Galois theory Open to faculty, staff, and students. 
Friday

Algebra Seminar Speaker: Dr. Brian Wynne, Department of Mathematics, Lehman University, CUNY Title: Infinitesimals and the hyperreal numbers 
Saturday 
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 23, 2023. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! Register Here for Fall, 2024 Math Circles 
Monday 
Speaker: Merve Karabulut, Florida Atlantic University Title: Number Theoretic Transform: A Pythonbased Speed Enhancement Abstract: Our proposal involves a Pythonbased solution that utilizes Numba's justintime compilation capabilities. We aim to optimize the control flow of the Number Theoretic Transform (NTT) operation to exploit parallelism in modern CPUs. Our solution leverages multicore processing, multithreading, and cache memory. Speaker biography: Merve is a computer engineering graduate from Yildiz Technical University, with experience in fullstack development and blockchain, especially with Hyperledger. At FAU, she is working towards a Ph.D., focusing on PQC with Dr. Reza Azarderakhsh. Her goal is to create secure solutions resistant to quantum computing and efficient implementation of algorithms. 
Monday 
Candidate, Cryptography Speaker: Dr. Edgar Costa, Cryptography (candidate for a faculty position) Title: Codebased Cryptography and symmetric Cryptography via Galois theory Open to faculty, staff, and students. There are also informal meeting sessions (Rm 212) in the morning 1010:30am and afternoon 15:3016:00pm. Please join and meet the candidate if you are available. 
Wednesday 
Candidate, Cryptography Speaker: Dr. Dipayan Das, Cryptography (candidate for a faculty position) Title: Cryptanalysis of some Latticebased Assumptions Open to faculty, staff, and students. 
Thursday 
Candidate, Data Science in Statistics Speaker: Dr.Qing Guo, Data Science in Statistics (candidate for a faculty position) Title: Cryptanalysis of some Latticebased Assumptions Open to faculty, staff, and students. 
Monday 
Florida GeoGebra Conference 2024 Integrating free mathematical software GeoGebra into STEM Education: A Mathematics Perspective workshop offered through the FAU StilesNicholson STEM Teacher Academy (SNSTA)*. For more information on the SNSTA, please email
SNSTA@fau.edu

Monday 
Join the faculty and students of Cryptography for a biweekly reading seminar on multiparty computations. 
Saturday 
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 23, 2023. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! Register Here for Fall, 2024 Math Circles 
Monday SE 215

Candidate, Data Science in Statistics Speaker: Dr. Borislav Hristov, Data Science in Statistics (candidate for a faculty position) Title: Abstract: A herculean task that scientists face today is to understand how changes in one’s own genome can lead to a disease and to potentially devise personalized treatment based on each individual’s DNA. To tackle this task researchers have spent billions of dollars amassing different types of relevant datasets from thousands of patients, across dozens of tissues, and millions of cells. However, the interpretation of these enormous and noisy datasets has not been straightforward, necessitating the development of computational, statistical and machine learning models for their analysis that face unique challenges. In this talk, I will describe two projects that further our ability to computationally highlight disease causing genes and to integrate measurements from disjoint datasets. First, I will present a networkbased approach that employs a graph diffusion kernel and an integer programming algorithm to examine the perindividual mutational profiles of cancer patients in order to unveil rare, statistically undetectable, genomic variants that drive tumorigenesis. Second, I will describe how a constrained supermodular optimization over graph neighborhood structures can align single cell measurements from different experiments. I will conclude by asserting the importance of interchromosomal interactions during heart development and by presenting a novel deep tensor architecture for predicting changes to these interactions. Open to faculty, staff, and students. 
Monday 
Speaker: Dr. Lukas Kölsch, Assistant Professor, University of South Florida Title: A general and unifying construction for semifields and their related maximum rank distance codes Abstract : Semifields are algebraic structures that can be for instance used to construct nondesarguesian planes in finite geometry, as well as maximum rank distance (MRD) codes with special parameters (more precisely, every element in the code will be a square matrix with full rank). Many constructions of MRD codes are rooted in ideas from semifield theory. Interestingly, many known constructions of semifields only exist in even dimension (i.e. the dimension over the prime field is even), leading to MRD codes in even dimension or MRD codes in odd dimension over a field of even degree. In this talk, we present a unifying construction for almost all semifields of this type, including semifields found by Dickson, Knuth, HughesKleinfeld, Taniguchi, Dempwolff, Bierbrauer, ZhouPott in the last 120 years. Our construction recovers all these semifields, and gives many new examples. 
Wednesday 
Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! 
Thursday 
Speaker: Albert Madinya, Ph.D. Candidate Title: The Spaces of Minimal Prime Elements of Algebraic Frames Without FIP Abstract: The dissertation investigates algebraic frames and their spaces of minimal prime elements with respect to the HullKernel topology and Inverse topology. Much work by other authors has been done in obtaining internal characterizations in frametheoretic terms for when these spaces satisfy certain topological properties, but most of what is done is under the auspices of the finite intersection property. In the first half of this dissertation, we shall add to the literature more characterizations in this context, and in the second half we will study general algebraic frames and investigate which, if any, of the known theorems generalize to algebraic frames not necessarily with the FIP. Throughout this investigative journey, we have found that certain ideals and filters of algebraic frames play a pivotal role in determining internal characterizations of the algebraic frames for when interesting topological properties occur in its space of minimal prime elements. In this dissertation, we investigate completely prime filters and compactly generated filters on algebraic frames. We introduce a new concept of subcompact elements and subcompactly generated filters. One of our main results is that the inverse topology on the space of minimal prime elements is compact if and only if every maximal subcompactly generated filter is completely prime. Furthermore, when the space of minimal prime elements is compact, then each minimal prime has what we are calling the compact absoluteness property. Please contact Dr. Hongwei Long <hlong@fau.edu> for an electronic copy of the dissertation. Zoom Meeting link: https://fauedu.zoom.us/my/amadinya2016?pwd=UG5UZno2RXdsdU9razFIS2xYamtYUT09&omn=84177486286 

January 2024 
Mon.Wed. 

Saturday 
American Mathematics Competition  Middle School Students The AMC8Middle School Math Day will be held at FAU 
Tuesday 
Crypto Cafe Speaker: Dr. Veronika Kuchta, Florida Atlantic University Title: PostQuantum Signatures from Secure Multiparty Computation (Dr. Kuchta will present Chapter 3 of Feneuil’s thesis).
Abstract: The ongoing effort to build a quantum computer urges the cryptography community to develop new secure cryptosystems based on quantumhard cryptographic problems. In this thesis, we focus on the design of signature schemes built from zeroknowledge proofs of knowledge. More precisely, we focus on the MPCintheHead paradigm which provides a generic way to build zeroknowledge proofs using techniques from secure multiparty computation. 
Saturday 
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 23, 2023. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! Register Here for Fall, 2024 Math Circles 
Tuesday 
Crypto Cafe Speaker: Dr. Vincenzo Pallozzi Lavorante, Postdoctoral fellow, University of South Florida Title: Locality and complexity distribution in coding theory, an approach based on Galois theory Abstract: The storage of information and the necessity to ease the heaviness of big data computations are two key aspects to consider when investigating new problems in coding theory. The concept of locality is closely linked to the reliability of distributed storage systems, while matrix multiplication is often the first operation required for secure distribution. This presentation will provide an overview of the latest developments and explore how Galois theory can offer valuable tools for addressing and contributing to these areas. Bio: Dr. Pallozzi Lavorante received a Ph.D. in Mathematics in 2022 from the University of Modena and Reggio Emilia in Italy. Since August 2022 he has been a Postdoctoral fellow at the University of South Florida. His research interest focuses on Galois Theory and polynomials over finite fields with applications to coding theory, codebased cryptography, and finite geometry. 

December, 2023 
Friday 
Analysis and Applications Seminar Speaker: Taylor Brysiewicz, University of Western Ontario Title: Algebraic Matroids, Monodromy, and the Heron Variety
Abstract: Heron's formula gives the area of a triangle in terms of the lengths of its sides. More generally, the volume of any simplex is determined by its edgelengths via a CayleyMenger determinant. 
Saturday 
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 23, 2023. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! Register Here for Fall, 2023 Math Circles 
Monday 
FAU Math Club Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! 
Tuesday 
Speaker: Dominic Gold, Florida Atlantic University Title: TDAPreprocessing Yields Quantifiable Efficiency Gains in PrivacyPreserving ML Models Abstract: Computational tools grounded in algebraic topology, known collectively as topological data analysis (TDA), have been used for dimensionalityreduction to preserve salient and discriminating features in data. TDA's flagship method, persistent homology (PH), extracts distinguishing shape characteristics from the data directly and provide inherent noisetolerance and compact, interpretable representations of highdimensional data that are amenable to wellestablished statistical methods and machine learning (ML) models; this faithful but compressed representation of data motivates TDA's use to address the complexity, depth, and inefficiency issues present in privacypreserving, homomorphic encryption (HE)based ML models through ciphertext packingthe process of packing multiple encrypted observations into a single ciphertext for Single Instruction, Multiple Data (SIMD) operations. By investigating several TDA featurization techniques on the MNIST digits dataset using a logistic regression (LR) classifier, we demonstrated that the TDA methods chosen improves encrypted model evaluation with a 1025 fold reduction in amortized time while improving model accuracy up to 1.4% compared to naive reductions that used downscaling/resizing. The developed technique also has implications for multiclass classification by sending multiple model classifications in a single packed ciphertext to reduce the communication overhead between the Client and Server, potentially avoiding restriction to a binary classification (as done in past HEML literature for secure classification of MNIST digits). Biography: Dominic Gold is a 6thyear graduate teaching assistant at Florida Atlantic University who studies both cryptography and data science, with his main interest in secure/privacypreserving machine learning on encrypted data. The intersectionality of his research in homomorphic encryption and topological data analysis shows promising implications for research in both fields, with his work in cryptography recognized by venues such as USENIX and ACM CCS. The ultimate goal of his work is to enable realtime predictions on encrypted biomedical data to improve both the reliability, security, and equitability of healthcare systems. Meeting ID: 878 9825 0483 Passcode: gHJF6g All are cordially invited. 
Saturday 
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 23, 2023. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! Register Here for Fall, 2023 Math Circles 

November, 2023 
Wednesday 
Algebra Seminar
Speaker:
Dr. Robert Lubarsky, Florida Atlantic University
Title: On the Location of Winning Strategies for F$_\sigma$ Games Abstract: Suppose A is a set of infinite sequences of natural numbers. This induces a game G(A): players I and II alternate turns picking a natural number, thereby producing an infinite sequence; I wins if this sequence is in A, II wins if it is not. Does either player have a winning strategy? If A is simply definable, then yes, with the complexity of producing such a winning strategy growing rapidly as the complexity of A increases. I will introduce this topic and discuss some of the issues that come up, aiming at some of the open questions that remain when A is an F$_\sigma$ set, meaning a countable union of closed sets. All are cordially invited 
Thursday 
Analysis and Applications Seminar Speaker: Dr. Zvi Rosen, Florida Atlantic University Title: Angles in Planar Frameworks Abstract: What subsets of distances among n points in the plane are enough to determine all pairwise distances? This question was answered with a theorem by Hilda PollaczekGeiringer in 1927, reproved by Gerard Laman in 1970. Interestingly, Whiteley proved in 1987 that the edge directions (or bearings) of a planar framework have the very same combinatorics. In this talk we will discuss some new results about a more complicated question still: What subsets of angles among n points in the plane are enough to determine all angles? We will also develop some angle analogs of rigiditytheoretic concepts like Laman numbers, circuits, and the pure condition. This is based on joint work with Sean Dewar, Georg Grasseger, Anthony Nixon, William Sims, Meera Sitharam, and David Urizar. All are cordially invited 
Thursday Nov. 2 
Association for Women in Mathematics (AWM) FAU's Student Chapter FAU's Student Chapter of the AWM presents "An Afternoon Tea Time!" (flyer) Please join us for a cup of tea, cookies and conversation about mathematics. All are cordially invited! 
Saturday 
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 23, 2023. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! Register Here for Fall, 2023 Math Circles 
Monday 
FAU Math Club Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! 
Tuesday 
Speaker: Zhenisbek Assylbekov, Department of Mathematical Sciences, Purdue University Fort Wayne, Fort Wayne, IN Title: Intractability of Learning AES with Gradientbased Methods Abstract: We show the approximate pairwise orthogonality of a class of functions formed by a single AES output bit under the assumption that all of its round keys except the initial one are independent. This result implies the hardness of learning AES encryption (and decryption) with gradientbased methods. The proof relies on the BoasBellman type of inequality in innerproduct spaces. Keywords: Advanced Encryption Standard, Block Ciphers, Gradientbased Learning Bio: Zhenisbek has a PhD in Mathematical Statistics from Hiroshima University. After the PhD and some period of work in industry, he got a job at Nazarbayev University, where he was working as a Teaching Assistant, Instructor, and Assistant Professor in the Department of Mathematics during 20112023. Currently, he is an Assistant Professor of Data Science at Purdue University Fort Wayne. His research interests are in machine learning with applications to natural language processing (NLP). He is interested in both the theoretical analysis of machine learning algorithms and the practical implementation and experimental evaluation of such algorithms on text data. He is also interested in hardness of learning which is closely related to cryptography because cryptographic primitives are exactly what is hard for machine learning. 
Wednesday 
Algebra Seminar Speaker: Christian Corbett, Florida Atlantic University Title: Properties of delements in algebraic frames with FIP Abstract: Given an algebraic frame with the finite intersection property (FIP), we say an element x is a delement if can be represented as the supremum of double polars of compact elements that lie below x. The collection of all delements is denoted as dL. By Zorn’s lemma, there exist maximal delements, and so we may equip the maximal elements of with the hullkernel topology, and we call this topology Max(dL). In this presentation, we will discuss some properties of delements, dL, and some of the topological properties of Max(dL). 
Wednesday 
American Mathematics Competition  High School Students
The AMC10/12A Contest will be held at FAU 
Tuesday 
American Mathematics Competition  High School Students
The AMC10/12B Contest will be held at FAU 
Thursday 
FAU Recruitment Seminar Speaker: Francesco Sica, Florida Atlantic University Presentation: FAU Math PhD recruitment talk to Nazarbayev University, Kazakhstan FAU Ph.D. sudent are welcome to join the Zoom meeting to share your experience as PhD students with the audience from Nazarbayev University in Kazakhstan. Join Zoom Meeting: https://fauedu.zoom.us/j/82700380173?pwd=eEV0aEl1SGZ2S3pnVVg2ZFR2U1hIQT09 Meeting ID: 827 0038 0173 Passcode: hKQh6F 

Analysis and Applications Seminar Speaker: Dr. Francis Motta, Florida Atlantic University Title: Mathematical methods for the study of Plasmodium intraerythrocytic cycle dynamics Abstract: Malaria infections totaled nearly 250 million cases worldwide in 2021, with the estimated number of malaria deaths nearing 620,000. Despite its significant global impact, much remains unknown about the fundamental biology of Plasmodium, the parasite which causes malaria infection. In this talk we will highlight recent modelling and statistical data analysis approaches tailored to answer important biological questions about the hostparasite dynamics during one of the prominent stages of the Plasmodium life cycle, the intraerythrocytic development cycle. The dynamics of the intraerythrocytic development cycle is characterized by populationsynchronized periodic cellular development, parasite replication, egress from and reinvasion of red blood cells. Motivated by this dynamic process, we will also discuss ongoing efforts to rigorously define a quantified measure of population (a)synchrony, establish its desirable properties, and develop and apply the appropriate mathematical modelling framework to study the dynamics of synchronization for a population of individuals progressing through a common state space. This will lead us to consider welltrodden mathematical theory of discretetime, multitype, Markov branching processes. We will also discuss the potential usefulness of such models to motivate new biological experiments involving Plasmodium and speculate on potential biological discoveries that could motivate the need for new mathematical theories and analyses. 
Thursday 
MS Exam Speaker: Julie Kent, MS Candidate, Florida Atlantic University Title: ThreeGap Theorem Abstract: The ThreeGap Theorem states that there are at most three unique distances between n points on a circle placed at angles a, 2a, 3a, and so on. In this talk, I will work through this proof as well as the more general result. Additionally, I will prove an additional condition which results in only two unique distances. Join Zoom Meeting: https://fauedu.zoom.us/j/2703788960 Meeting ID: 270 378 8960 
Thursday 
Algebra Seminar (Jupiter Campus) Speaker: Dr. Yiqiang Zhou, Newfoundland and Labrador's University Title: Fine rings and generalizations Abstract: A ring (associative with identity) is called a fine ring if every nonzero element in it is the sum of a unit and a nilpotent element. G. Cǎlugǎreanu and T.Y. Lam initiated the study of fine rings in "Fine rings: A new class of simple rings." J. Algebra Appl. (2016). In this talk, we review known results and discuss new developments of this study. 
Saturday 
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 23, 2023. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! Register Here for Fall, 2023 Math Circles 
Monday 
FAU Math Club Join your friends and other math enthusiasts at FAU's Math Club! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics. The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! 
Tuesday 
Speaker: Paolo Santini, Universita Polotecnica Delle Marche, Italy Title: A New Formulation of the Linear Equivalence Problem and Shorter LESS Signatures Abstract: The problem of determining whether two linear codes are equivalent is called Code Equivalence Problem. When codes are endowed with the Hamming metric (which is the most studied case), the equivalence is mainly considered with respect to monomial transformations (permutations with scaling factors) and the problem is known as the Linear Equivalence Problem (LEP). Code equivalence can be described as a transitive, noncommutative group action and, as such, finds a natural application in cryptography: for example, it is possible to design zeroknowledge proofs, and hence signature schemes. In recent works, it has been shown that LEP can be reformulated using notions such as information sets (arguably, ubiquitous objects in coding theory) and canonical forms. This unlocks some new features, such as the possibility of communicating the equivalence map in a very compact way (which leads to much shorter signatures), as well as opening new attack avenues. In this talk, we recall the basics of code equivalence and then focus on these recent results, aiming to describe how they can be applied to boost the performance of cryptographic schemes. Meeting ID: 878 9825 0483 Passcode: gHJF6g All are cordially invited. 
Tuesday 
Association for Women in Mathematics, (FAU Student Chapter) Tea Time! The Student Chapter of the AWM invites you to our traditional Tea Time on Thursday, November 21, at 4 p.m., SE 215. Please come and enjoy fellowship, and discussion about mathematics before the Thanksgiving break. We have cookies and tea for everyone. AWM future activities will be discussed. We will also introduce you and all students to the Mentoring program.

Wednesday 
Algebra Seminar Speaker: Papiya Bhattacharjee, Florida Atlantic University Title: Max(dL) vs. Min(L), for MFrames L
Abstract
:
The space of maximal dideals of
C(X)
is homeomorphic to the
Z♯ultrafilters, and this space is the minimal quasiF cover of a compact Tychonoff space
X. In this talk the notions of maximal dideals and
Z♯ 
Thursday 
Analysis and Applications Speaker: Subhosit Ray, Florida Atlantic University Sandbox Title: A Peek into Equivariant Deep Learning Abstract: Current research in AI has focused chiefly on increased parameterization and data augmentation techniques to generalize their performance on outofdistribution signals. Despite these improvements, performance may still fail under some symmetric transformations of the signals. Equivariant deep learning is a relatively niche but growing field that aims to tackle the problems by directly incorporating symmetries in neural architecture. In this presentation, I review a few works on equivariant deep learning and how it combines the world of abstract algebra, such as group theory, into deep learning. 

October 2023 
Wednesday 
Algebra Seminar Speaker: Albert Madinya, Florida Atlantic University Title: Topologizing the Space of Minimal Primes of an Algebraic Frame Abstract: An algebraic frame L is a partially ordered set in which every subset of L has a supremum and infimum and satisfies the strong distributive law. Given an algebraic frame L, we can topologize the set of minimal prime elements of L, which we will denote by Min(L). One such way we could topologize Min(L) is with the HullKernel topology as is done with the prime ideals of a commutative ring. The other is the inverse topology which has a similar construction to that of the HullKernel topology. Our aim in this talk to is to study these topological spaces and the interplay that exists between the topological properties of Min(L) and the frametheoretic properties of L. 
Thursday 
Analysis and Application Seminar Speaker: Jason MirelesJames, Florida Atlantic University Title: Divergent Series in Dynamical Systems Theory: Numerical Analytic Continuation for Nonlinear Problems Abstract: Last semester I gave a short talk about using the Borel transform to study problems in differential equations whose formal power series solutions diverge. In this case, it would be nice to have rigorous error bounds describing how well the truncated divergent series approximates the true solution of the differential equation. In last semester's talk we worked out a satisfactory solutions to a simple linear example problem due to Euler. In this talk I will review some basic ideas about the Borel transform, and also recall very quickly the result from the previous talk. Then I'll discuss how nonlinearities complicate the picture, leading to some nonlocal convolution operators. I'll sketch numerical procedures for managing these complications, at least in a simple example problem, and will indicate how bounds on the numerical errors could be obtained using fixed point methods. This is all very much work in progress, but I think it is also very interesting stuff and hope you will enjoy. 
Tuesday 
Crypto Café
Title: Analysis for lattice enumeration Abstract: Lattice reduction algorithms such as BKZ (BlockKorkineZolotarev) play a central role in estimating the security of latticebased cryptography. The subroutine in BKZ which needs to find the shortest vector in a projected sublattice can be instantiated with enumeration algorithms. The enumeration procedure can be seen as a depthfirst search on some `"enumeration tree" whose nodes denote a partial assignment of the coefficients, corresponding to lattice points as a linear combination of the lattice basis with the coefficients. This work provides a concrete analysis for the cost of quantum lattice enumeration based on the quantum tree backtracking algorithm of Montanaro (ToC, '18). More precisely, we give a concrete implementation of Montanaro's algorithm for lattice enumeration based on the quantum circuit model. We also show how to optimize the circuit depth by parallelizing the components. Based on the circuit designed, we discuss the concrete quantum resource estimates required for lattice enumeration. This is a joint work with Shi Bai, MayaIggy van Hoof, Floyd B. Johnson, and Tanja Lange. Meeting ID: 878 9825 0483; Passcode: gHJF6g All are cordially invited. 
Thursday 
Analysis and Application Seminar Speaker: Dr. Francesco Sica, Florida Atlantic University Title: In pursuit of the Erymanthian boar: Towards a deterministic subexponential factoring algorithm. Abstract: I will describe a connection between the computation of the prime factors p,q of pq (an RSA modulus), and the analytic theory of the Riemann zeta function. The problem will be thus reduced to the evaluation of some oscillating series, where I will present some new partial results. 
Saturday 
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 23, 2023. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! Register Here for Fall, 2023 Math Circles 
Monday 
FAU SIAM (Society for Industry and Applied Mathematics) Student Chapter The FAU SIAM (Society for Industry and Applied Mathematics) Student Chapter is delighted to announce that we are hosting a reading group this semester. The group’s mission is to advance undergraduate and graduate student interdisciplinary collaborations across the STEM fields. The first reading group will focus on topics at the intersection of Biology, Mathematics, and Computer Science. We hope to not just discuss open problems in biomath, but also collaborate to tackle them using topological data analysis, and other stateoftheart machine learning/data mining techniques. If you are interested in biomath, machine learning, and/or data mining, please join us for our first meeting on October 16 at 5:30 pm. We plan to meet twice a month and, most importantly, at this first meeting we will have FREE PIZZAS!!! If you are interested in joining, please RSVP by replying to this email to let us know you intend to come. If you have any questions let us know, or you can reach out to the SIAM faculty advisor, Dr. Francis Motta fmotta@fau.edu . On behalf of FAU SIAM Student Chapter, Matthew Trang 
Wednesday 
Algebra Seminar Speaker: Dr. Parker Edwards, Florida Atlantic University Title: An applied topologist's overview of numerical algebraic geometry Abstract: Suppose that someone hands you a list of polynomial equations and you want to know information about their set of solutions. The first questions you likely want answered are:
Numerical algebraic geometry (NAG) algorithms answer these questions via numerical solving methods: Think NewtonRaphson style solving, but more sophisticated. In this talk, I will discuss some basics of NAG methods with a few examples and try to give a scope both for the theoretical and practical considerations that go into using NAG software to solve problems. 
Thursday 
Analysis and Applications Seminar Speaker: Noah Corbett, Florida Atlantic University Title: Predicting State Switches in Chaotic Dynamical Systems Abstract: Making longterm predictions in chaotic dynamical systems is a difficult task, especially when one cannot measure all the variables influencing the system. In this work, we propose a general methodology to predict certain macroscopic features of chaotic dynamical systems, such as state switches, that does not require perfect measurements of all the phase variables. We will then apply the method to the Lorenz System and Chua’s Circuit and analyze the performance of the method for both short and longterm predictions. 
Tuesday 
Speaker: William Youmans, Florida Atlantic University Title: An algorithm for solving the principal ideal problem with subfields Abstract: The principal ideal problem (PIP) is the problem of deciding whether a given ideal of a number field is principal and, if it is, of finding a generator. Solving the PIP applies to solving major computational tasks in number theory. It is also connected to the search for approximate short vectors in socalled ideal lattices, which is a crucial problem in cryptography. We present a novel application of norm relations to utilize information from subfields to solve the PIP in fields of degree up to 1800. Bio: Dr. William Youmans received a BA in pure mathematics in 2017 and a PhD in mathematics in 2023 from the University of South Florida. Since May 2023 he has been a postdoctoral research fellow at Florida Atlantic University. His research interests include latticebased cryptography, computational number theory, and quantum algorithms. Meeting ID: 878 9825 0483 Passcode: gHJF6g All are cordially invited. 
Wednesday 
Algebra Seminar Speaker: Daniela Nikolova, Florida Atlantic University Title: On the Covering Numbers of Small Symmetric and Alternating Groups, and Some Sporadic Groups Abstract: Click HERE All are cordially invited. 
Thursday 
Analyisis and Applications Speaker: Maxime Murray, Florida Atlantic University Title: An overview of the dynamics near the Lagrange points in the circular restricted fourbody problem Abstract: The circular restricted fourbody problem considers the motion of a massless object under the gravitational effect of three bodies, called the primaries, whose motion is restricted to the equilateral triangle configuration of Lagrange. This system admits up to 10 equilibrium points, and a vertical family of Lyapunov periodic obits is attached to some of these points. In this talk, we investigate how such Lagrange points organize the dynamics of the systems. First, we will observe and compare the homoclinic dynamics in the planar and spatial case. Then, we will study the heteroclinic case which, in conjunction with Smale Horseshoe theorem, provides the existence of a family of periodic orbit orbits revolving around all three primaries. All are cordially invited. 
Saturday 
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 23, 2023. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! Register Here for Fall, 2023 Math Circles 
Tuesday 
Doctoral Dissertation Defense Speaker: Amish Bishal Title: Topological Data Analysis for Data Science: The DelaunayRips Complex, Triangulation Stabilities, and Protein Stability Predictions Advisor: Dr. Francis Motta Abstract: Topological Data Analysis (TDA) is a relatively new field of research that utilizes topological notions to extract discriminating features from data. Within TDA, persistent homology (PH) is a robust method to compute multidimensional geometric and topological features of a dataset. Because these features are often stable under certain perturbations of the underlying data, are often discriminating, and can be used for visualization of structure in highdimensional data and in statistical and machine learning modeling, PH has attracted the interest of researchers across scientific disciplines and in many industry applications. However, computational costs may present challenges to effectively using PH in certain data contexts, and theoretical stability results may not hold in practice. In this dissertation, we develop an algorithm that can reduce the computation burden of computing persistent homology on point cloud data. Naming it DelaunayRips (DR), we define, implement, and empirically test this computationally tractable simplicial complex construction for computing persistent homology of Euclidean point cloud data. We demonstrate the practical robustness of DR for persistent homology in comparison with other simplical complexes in machine learning applications such as predicting sleep state from patient heart rate. To justify the theoretical stability of DR, we prove the stability of the Delaunay triangulation of a pointcloud P under perturbations of the points of P. Specifically, we impose a notion of genericity on the points of P to ensure stability. In the final chapter, we contribute to the field of computational biology by taking a datadriven approach to learn topological features of designed proteins from their persistence diagrams. We find correlations between the learned topological features and biochemical features to investigate how protein structure relates to features identified by subjectmatter experts. We train several machine learning models to assess the performance of incorporating topological features into training with biochemical features. Using covertree differencing via entropy reduction (CDER), we identify distinguishing regions of the persistence diagrams of stable/unstable proteins. More notably, we find statistically significant improvement in classification performance (in terms of average precision score) for certain designed secondary structure topologies. Please contact Dr. Hongwei Long <hlong@fau.edu> for an electronic copy of the dissertation. Zoom Meeting information (Zoom Only): Amish Mishra is inviting you to a scheduled Zoom meeting. Passcode: John1:14 All are cordially invited 

September 2023 
Tuesday 
Speaker : Paul Zimmermann, Directeur de Recherche at INRIA/LORIA (Nancy, France)
Bio
: Paul Zimmermann's research interests include asymptotically fast arithmetic, computer algebra, and computational number theory. Together with Richard Brent, he has written the book "Modern Computer Arithmetic," and he has coordinated the book "Computational Mathematics with SageMath." He has contributed to some of the record computations in integer factorization and discrete logarithm. He is the author or coauthor of several computer packages, including the GNU MPFR library providing arithmetic on floatingpoint numbers with correct rounding, and CADONFS, an implementation of the number field sieve for integer factorization. His latest project is COREMATH, an implementation of mathematical functions with correct rounding for the IEEE 754 standard formats.
Title
: Deciphering Charles Quint (A diplomatic letter from 1547)

Thursday 
Analysis and Applications Seminar
Speaker:
Dr. Erik Lundberg, Florida Atlantic University
Title: Arclength null quadrature domains and vortex dynamics Abstract: A planar domain (viewed as a region in the complex plane) is referred to as an arclength null quadrature domain if the integral with respect to the arclength of any (complex) analytic function (in the Smirnov space—the appropriate function space for integrating with respect to arclength) along the boundary vanishes. We use classical results from complex analysis and potential theory (due to HavinsonTumarkin and DenjoyCarlemanAhlfors) in order to prove the existence of a roof function (a positive harmonic function whose gradient coincides with the inwardpointing normal along the boundary) for any arclength null quadrature domain having finitely many boundary components. This bridges a gap toward the classification of arclength null quadrature domains by removing an a priori assumption from previous classification results. This result also strengthens a known connection between arclength null quadrature domains and a free boundary problem for Laplace’s equation that has applications in fluid dynamics (equilibrium solutions for dynamics of vortices with constant pressure core) that will be explained in the talk. This is joint work with Dmitry Khavinson. 
Thursday 
Analysis and Applications Seminar
Speaker:
Dr. Parker Edwards, Florida Atlantic University
Title: A computational viewpoint on distance functions and applications Abstract: One of the main theoretical approaches in computational geometry and topology runs as follows: Let d_X:R^n\to R be the distancetoX function for a compact subspace X in R^n and let P be a "good" finite sample of X. The goal is usually to show that an algorithm of interest correctly extracts information about d_X when using the point set P as input. The critical point theory for distance functions initiated by Grove and Shiohama in 1977 is precisely the right framework for analyzing this behavior. For most subspaces, d_X is not differentiable everywhere. With the right definition of critical points and values, however, one recovers Morsefunction type behavior for d_X. In this first of two talks, I will give a gentle introduction to this theory in the computational geometry context, accompanied by a motivating application from robotics. 
Saturday 
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, and playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 23, 2023. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! 
Tuesday 
Crypto Café
Title: Exploring the Power of Multivariate Public Key Cryptography (MPKC) Abstract: Multivariate Public Key Cryptography (MPKC) leverages multivariate quadratic polynomial mappings over finite fields as the foundation for its trapdoor oneway functions. This innovative approach offers remarkable efficiency in both encryption and decryption processes, making it a compelling choice for secure communications. In contrast to traditional cryptographic methods, attacking MPKC involves solving a system of nonlinear equations over the finite field, a significantly more complex challenge than NPhard problems like Boolean satisfiability, which is equivalent to solving equations over the finite field GF(2). In this presentation, we will delve into MPKC through a simplified example featuring three variables within the finite field of GF(2). This illustrative toy example will demystify key concepts such as public and secret keys, encryption, decryption, and cryptanalysis. Join us as we unravel the intriguing world of MPKC and its potential impact on modern cryptography. 
Tuesday 
MS Exam Speaker: Ian Morgan, MS Candidate, Florida Atlantic University Title: NTRU Public Key Cryptosystem Abstract: In this presentation, we describe NTRU, a new public key cryptosystem. NTRU encryption and decryption uses a mixing system suggested by polynomial algebra combined with a clustering principle based on elementary probability theory. The security of the NTRU cryptosystem comes from the interaction of the polynomial mixing system with the independence of reduction modulo two relatively prime integers p and q. All are cordially invited. 
Wednesday 
Algebra Seminar Speaker: Matthew Trang, Florida Atlantic University Title: Covering Relations in Neural Codes
Abstract: How does my brain do this? This is a question that everyone must have asked themselves at least once in their lifetime. Brains are composed of billions of neurons and mysteriously they manage to use these neurons to encode the data of external stimuli from the real world via neuron firing events. This 
Thursday 
Analysis and Applications Seminar
Speaker:
Dr. Parker Edwards, Florida Atlantic University
Title: Real, algebraic, and computational geometry/topology Abstract: Semialgebraic spaces are the sets of real solutions to systems of polynomial equations and inequalities. A finite list of polynomials defining such a space is a complete specification and algorithms for computing a space's geometric or topological properties using that list as input have been studied for decades. Most of those algorithms are unimplemented, however, as they were designed primarily to investigate computational complexity. In this second talk, I will discuss some recent work with colleagues to design and implement efficient algorithms in the real algebraic geometry context using a computational geometry/topology approach. While we have made progress, the story is far from settled. I will therefore also present some related open questions/directions in this area. 
Saturday 
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 23, 2023. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! 

August, 2023 
Tuesday 
Crypto Café
Title: Challenges in Securing a Worldwide Enterprise Network Footprint  The Basics from Australia to Zimbabwe. Abstract: Many modern theories on Information Security rely on sophisticated and efficient infrastructure we take for granted in developed countries. When operating in nearly every country in the world it is necessary to focus on the basics. There might be questionable infrastructure or even openly hostile host nations, but basic "hygiene" is often the best roadmap to securing information and communication  and often the most neglected. Biography: Adam Yergovich works for the Department of State, Bureau of Diplomatic Security as a Regional Cyber Security Officer currently stationed in Fort Lauderdale Florida. He has previously been stationed in Frankfurt Germany, Bangkok Thailand, and Moscow Russia but traveled extensively within those regions. He graduated from from the University of California Davis with a degree in Computer Science and Engineering and worked for several years designing single board computers for a small California company before joining State. 