The emergence of AI, particularly large language models (LLMs), has dramatically reshaped the requirements for error-correcting codes, particularly in the realm of memory I/O during training. Massive data transfers involved in training LLMs necessitate extremely robust error correction to prevent costly retraining scenarios triggered by undetected errors (Silent Data Corruption). Traditional iterative decoding techniques are inadequate due to their latency constraints, pushing the field towards combinational logic implementations capable of achieving multiple-error correction under extremely tight latency budgets. Algebraic codes, which once seemed to have lost ground to iterative decoding algorithms, are experiencing a renaissance driven by these stringent AI-driven performance demands. By exploiting deep results from algebra, notably Galois theory, algebraic codes are now being implemented in fully combinational hardware circuits that offer both the necessary decoding speed and robust error-correction guarantees. This development underscores algebraic coding theory?s renewed relevance and critical importance for future high-performance AI systems​.

Subscribing the Mathematics Colloquium mailing list:
https://groups.google.com/g/ipm-math-colloquium

An imaginary sort of a first-order structure is a possible universe of an interpretable structure. The significance of imaginary sorts was established in the abstract setting of Classification Theory by Shelah, where all notions of stability theory, especially algebraic closure, were interpreted with imaginary sorts taken into account. Imaginaries were studied for specific theories by Poizat who showed that algebraically closed fields and differentially closed fields eliminate imaginaries, i.e. each imaginary sort is in definable bijection with a definable set of n-tuples. In valued fields imaginary sorts differ qualitatively from definable sets; an example is the value group. In this case it is a question of finding a useful basis for the imaginary sorts, meaning that every imaginary sort can be embedded into a product of basis elements. A basis for imaginary sorts for algebraically closed valued fields was given by Haskell-Hrushovski-Macpherson. Rideau-Hrushovski-Martin, and more recently Hils-Rideau-Kikuchi, proved that for the field of $p$-adic numbers the $p$-adic lattices provide a basis for imaginary sorts.
In this talk I will describe joint work with Ehud Hrushovski which gives a description of imaginary sorts and their basis for products and restricted products of structures in terms of a basis for imaginary sorts for the factors. In 1959 Feferman and Vaught proved that the theory of a product is determined by the theory of the factors and the theory of the Boolean algebra of subsets of the index set. This yields decidability results and descriptions of definable sets for products in terms of the factors. Our results show that imaginaries also admit a description relative to the factors. The proofs use tools from geometric stability theory including liaison groups, and descriptive set theory of smooth Borel equivalence relations, including a dichotomy theorem due to Harrington-Kechris-Louveau and Glimm-Efros. As an application, we describe a basis for the imaginary sorts for the ring of adeles of rational numbers in terms of the family of $p$-adic lattices for �almost all� $p$, and prove weak elimination of imaginaries for the adeles in these sorts.
Joint work with: Ehud Hrushovski
Zoom room information: https://us06web.zoom.us/j/81916335336?pwd=5zQT4lutMiBoY5Xp1pkFGtbqiaGozg.1
Meeting ID: 819 1633 5336
Passcode: 559618

For any k + 1 ≥ 3 positive integers t, n_1, . . . , n_k, there exists a positive integer N such that if every t-element subset of the set {1, . . . , N} is colored using one of the k colors 1, . . . , k, then there exists an index i ∈ {1, . . . , k} and a subset S ⊆ {1, . . . , N} with |S| = n_i, such that every t-element subset of S is colored with color i. This is a generalization of Ramseys Theorem, which is often formulated in the language of graph theory by:
? interpreting {1, 2, . . . , N} as the vertex set of the complete graph K_N,
? considering the case t = 2, and
? coloring each 2-element subset (edge) with one of k colors.
Ramseys Theorem then implies that for any two positive integers s and t, there exists a minimum integer N such that in any red-blue coloring of the edges of K_N , one can find either a red complete subgraph Ks or a blue complete subgraph Kt. The smallest such N is known as the Ramsey number R(s, t), or more generally R(G, H) when considering arbitrary graphs G and H. Several variants of Ramsey numbers have been developed. Notably, the bipartite Ramsey number, the multipartite Ramsey number, the m-bipartite Ramsey number, and the pair bipartite Ramsey number extend the classical notions to bipartite and multipartite settings.
In this talk, we will present recent results concerning some of these extended versions. In particular, we will focus on:
? The multicolor bipartite Ramsey number BR(G_1, G_2, . . . , G_t), defined as the smallest integer n such that any t-edge-coloring of the complete bipartite graph K_{n,n} contains a monochromatic copy of G_i for some 1 ≤ i ≤ t.
? The pair bipartite Ramsey number Bp(G_1, G_2) = (a, b), the smallest ordered pair such that every red-blue edge-coloring of K_{c,d} with c ≥ d guarantees a blue copy of G_1 or a red copy of G_2, provided c ≥ a and d ≥ b.

Zoom room information:
https://us06web.zoom.us/j/84906984159?pwd=BCWaIbXBuku3A5I84zNg9mHFxVZjXD.1
Meeting ID: 849 0698 4159
Passcode: 362880