Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, December 05, 2013, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Chandan Dubey

Counting solutions of Quadratic equations over quotient rings

An $n$-ary integral quadratic form is a quadratic equation over integers in $n$ variables (denoted by $Q(x_1,\cdots,x_n)$). Integral quadratic forms appear in many areas of computer science e.g., lattices, cryptography, embeddings. We study integral quadratic forms over the ring $Z/p^kZ$, where $p$ is an odd prime. In particular, given and integral quadratic form $Q(x_1,\cdots,x_n)$ and a $t \in Z$, we want to count the number of solutions of $Q(x_1,\cdots,x_n)=t \pmod{p^k}$. This talk will be introductory. It will be aimed at providing a better understanding of quadratic forms and a brief connection to lattices and cryptography.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login