Algebra / Number Theory / Combinatorics Seminar

Name: CCMS Colloquium: Puttipong Pongtanapaisan (Pitzer)
Start: 2026-04-03T11:00:00-07:00
End: 2026-04-03T12:15:00-07:00
Location: Davidson Lecture Hall, CMC

S	M	T	W	T	F	S
0 events 1 0 events, 1	0 events 2 0 events, 2	1 event 3 1 event, 3 12:15 pm - 1:10 pm On a new version of Siegel’s lemma (Lenny Fukshansky, CMC) March 3 @ 12:15 pm - 1:10 pm On a new version of Siegel’s lemma (Lenny Fukshansky, CMC) The classical Siegel's lemma (1929) asserts the existence of a nontrivial integer solution to an underdetermined integer homogeneous linear system, whose "size" is small as compared to the size of the coefficients of the system. Far-reaching generalizations of this theorem, producing a full basis for the solution space, were obtained over number fields by Bombieri […]	0 events 4 0 events, 4	0 events 5 0 events, 5	0 events 6 0 events, 6	0 events 7 0 events, 7
0 events 8 0 events, 8	0 events 9 0 events, 9	1 event 10 1 event, 10 12:30 pm - 1:10 pm Hecke algebras and motives (Robert Cass, CMC) March 10 @ 12:30 pm - 1:10 pm Hecke algebras and motives (Robert Cass, CMC) Hecke algebras play a central role in both number theory and representation theory. While some Hecke algebras have explicit descriptions in terms of generators and relations, others are understood through structure constants that encode multiplicities in tensor products of representations. In this talk, I will discuss several projects with Thibaud van den Hove and Jakob […]	0 events 11 0 events, 11	0 events 12 0 events, 12	0 events 13 0 events, 13	0 events 14 0 events, 14
0 events 15 0 events, 15	0 events 16 0 events, 16	0 events 17 0 events, 17	0 events 18 0 events, 18	0 events 19 0 events, 19	0 events 20 0 events, 20	0 events 21 0 events, 21
0 events 22 0 events, 22	0 events 23 0 events, 23	1 event 24 1 event, 24 12:15 pm - 1:10 pm Computing certificates for complete positivity (Achill Schürmann, University of Rostock) March 24 @ 12:15 pm - 1:10 pm Computing certificates for complete positivity (Achill Schürmann, University of Rostock) A key problem in computer proofs based on solutions from copositive optimization, is checking whether or not a given quadratic form is completely positive or not. In this talk we describe the first known algorithm for arbitrary rational input. It is based on a suitable adaption of Voronoi's Algorithm and the underlying theory from positive definite […]	0 events 25 0 events, 25	0 events 26 0 events, 26	0 events 27 0 events, 27	0 events 28 0 events, 28
0 events 29 0 events, 29	0 events 30 0 events, 30	1 event 31 1 event, 31 12:15 pm - 1:10 pm Central moments of autocorrelation demerit factors of binary sequences (Daniel Katz, CSUN) March 31 @ 12:15 pm - 1:10 pm Central moments of autocorrelation demerit factors of binary sequences (Daniel Katz, CSUN) A low autocorrelation binary sequence of length $\ell$ is an $\ell$-tuple of $+1$s and $-1$s that does not strongly resemble any translate of itself. Such sequences are used in communications and remote sensing for synchronization and ranging, where translation represents time delay. A single number that indicates how good a sequence is for such purposes, […]