Differences

This shows you the differences between two versions of the page.

--- start [2025/05/06 17:48] – 139.124.146.3
+++ start [2025/06/09 16:53] (current) – 139.124.146.3
@@ Line 23: / Line 23: @@
+**June 17 2025: [[https://sites.google.com/view/noysofferaranov/bio|Noy Soffer Aranov]]** //Escape of Mass of Sequences//
-**May 20 2025: [[https://www.researchgate.net/profile/Pranjal-Jain-10|Pranjal Jain]]** //Partial Sums of Binary Subword-Counting Sequences//
+One way to study the distribution of nested quadratic number fields satisfying fixed arithmetic relationships is through the evolution of continued fraction expansions. In the function field setting, it was shown by de Mathan and Teullie that given a quadratic irrational $\Theta$, the degrees of the periodic part of the continued fraction of $t^n\Theta$ are unbounded. Paulin and Shapira improved this by proving that quadratic irrationals exhibit partial escape of mass. Moreover, they conjectured that they must exhibit full escape of mass. We construct counterexamples to their conjecture in every characteristic. In this talk we shall discuss the technique of proof as well as the connection between escape of mass in continued fractions, Hecke trees, and number walls. This is part of joint works with Erez Nesharim and Uri Shapira and with Steven Robertson.
-Let $w$ be a finite word over the alphabet $\{0,1\}$. For any natural number $n$, let $s_w(n)$ denote the number of occurrences of $w$ in the binary expansion of $n$ as a scattered subsequence. The talk aims to provide a systematic way of studying the growth of the partial sum $\sum_{n=0}^N (-1)^{s_w(n)}$ as $N \to \infty$. In particular, these techniques yield several classes of words $w$ with $\sum_{n=0}^N (-1)^{s_w(n)} = O(N^{1-\epsilon})$ for some $\epsilon >0$. We begin by motivating the ideas using the case of $w=01,011$. The talk is based on joint work with Shuo Li.
-**June 3 2025: Curtis Bright**
-**June 17 2025: [[https://sites.google.com/view/noysofferaranov/bio|Noy Soffer Aranov]]**
 **July 15 2025: [[https://apacz.matinf.uj.edu.pl/users/1719-elzbieta-krawczyk|Elżbieta Krawczyk]]**  //Quasi-fixed points of substitutions and substitutive systems//
@@ Line 41: / Line 36: @@
 ==== Past talks 2025 ====
+**June 3 2025: [[https://www.curtisbright.com/|Curtis Bright]]** //Mathematical Problems with SATisfying Solutions//
+Automated reasoning tools have been effectively used to solve a variety of problems in discrete mathematics.  In this talk, I will introduce satisfiability (SAT) solvers and highlight a variety of problems in discrete mathematics that have been tackled with a SAT solver.  As a case study, I will demonstrate how a SAT solver can be used to make progress on a question arising in combinatorics on words involving North-East lattice paths.
+{{ seminar2025:20250603bright.pdf |slides}}
+{{ seminar2025:20250603bright.mp4 |video of the talk}}
+**May 20 2025: [[https://www.researchgate.net/profile/Pranjal-Jain-10|Pranjal Jain]]** //Partial Sums of Binary Subword-Counting Sequences//
+{{ seminar2025:20250520jain.pdf |slides}}
+{{ seminar2025:20250520jain.mp4 |video of the talk}}
+Let $w$ be a finite word over the alphabet $\{0,1\}$. For any natural number $n$, let $s_w(n)$ denote the number of occurrences of $w$ in the binary expansion of $n$ as a scattered subsequence. The talk aims to provide a systematic way of studying the growth of the partial sum $\sum_{n=0}^N (-1)^{s_w(n)}$ as $N \to \infty$. In particular, these techniques yield several classes of words $w$ with $\sum_{n=0}^N (-1)^{s_w(n)} = O(N^{1-\epsilon})$ for some $\epsilon >0$. We begin by motivating the ideas using the case of $w=01,011$. The talk is based on joint work with Shuo Li.
 **May 6 2025: Jarkko Peltomäki** //The repetition threshold for ternary rich words//