Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Modular arithmetic

Related publications (24)

Non-planarity of Markoff graphs mod p

Matthew De Courcy-Ireland

We prove the non-planarity of a family of 3-regular graphs constructed from the solutions to the Markoff equation x2 + y2 + z2 = xyz modulo prime numbers greater than 7. The proof uses Euler characteristic and an enumeration of the short cycles in these gr ...

European Mathematical Soc-Ems2024

Arithmetic and geometric deformations of threefolds

Stefano Filipazzi, Fabio Bernasconi

We show that mixed-characteristic and equicharacteristic small deformations of 3-dimensional canonical (resp., terminal) singularities with perfect residue field of characteristic p>5 are canonical (resp., terminal). We discuss applications to arithmetic a ...

Wiley2023

BLOOM: Bimodal Lattice One-out-of-Many Proofs and Applications

Ngoc Khanh Karol Nguyen

We give a construction of an efficient one-out-of-many proof system, in which a prover shows that he knows the pre-image for one element in a set, based on the hardness of lattice problems. The construction employs the recent zero-knowledge framework of Ly ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

The double exponential runtime is tight for 2-stage stochastic ILPs

Kim-Manuel Klein, Alexandra Anna Lassota

We consider fundamental algorithmic number theoretic problems and their relation to a class of block structured Integer Linear Programs (ILPs) called 2-stage stochastic. A 2-stage stochastic ILP is an integer program of the form min{c(T)x vertical bar Ax = ...

SPRINGER HEIDELBERG2022

Strictly Real Fundamental Theorem Of Algebra Using Polynomial Interlacing

Soham Basu

Without resorting to complex numbers or any advanced topological arguments, we show that any real polynomial of degree greater than two always has a real quadratic polynomial factor, which is equivalent to the fundamental theorem of algebra. The proof uses ...

CAMBRIDGE UNIV PRESS2021

Experiments with the Markoff Surface

Matthew De Courcy-Ireland

We confirm, for the primes up to 3000, the conjecture of Bourgain-Gamburd-Sarnak and Baragar on strong approximation for the Markoff surface modulo primes. For primes congruent to 3 modulo 4, we find data suggesting that some natural graphs constructed fro ...

TAYLOR & FRANCIS INC2022

Computing Cyclic Isogenies between Principally Polarized Abelian Varieties over Finite Fields

Marius Lorenz Vuille

Abelian varieties are fascinating objects, combining the fields of geometry and arithmetic. While the interest in abelian varieties has long time been of purely theoretic nature, they saw their first real-world application in cryptography in the mid 1980's ...

EPFL2020

Restriction of 3D arithmetic Laplace eigenfunctions to a plane

Riccardo Walter Maffucci

We consider a random Gaussian ensemble of Laplace eigenfunctions on the 3D torus, and investigate the 1-dimensional Hausdorff measure ('length') of nodal intersections against a smooth 2-dimensional toral sub-manifold ('surface'). A prior result of ours pr ...

2020

Generalized Norm-compatible Systems on Unitary Shimura Varieties

Mohamed Réda Boumasmoud

We define and study in terms of integral Iwahoriâ Hecke algebras a new class of geometric operators acting on the Bruhat-Tits building of connected reductive groups over p-adic fields. These operators, which we call U-operators, generalize the geometric n ...

EPFL2019

Arithmetic and geometric structures in cryptography

Benjamin Pierre Charles Wesolowski

We explore a few algebraic and geometric structures, through certain questions posed by modern cryptography. We focus on the cases of discrete logarithms in finite fields of small characteristic, the structure of isogeny graphs of ordinary abelian varietie ...

EPFL2018

Improving Circuit Mapping Performance Through MIG-based Synthesis for Carry Chains

Giovanni De Micheli, Paolo Ienne, Pierre-Emmanuel Julien Marc Gaillardon, Mathias Soeken, Luca Gaetano Amarù, Xifan Tang, Grace Zgheib, Ana Petkovska

Hard-wired carry chains in FPGAs are designed to improve efficiency of important arithmetic primitives. Although they are proven to be effective for arithmetic-rich functions, there are very few studies on the optimization opportunities of carry chains for ...

ACM2017

An improvement on the number of simplices in F-q(d)

Van Thang Pham

Let epsilon be a set of points in F-q(d). Bennett et al. (2016) proved that if \epsilon\ >> [GRAHICS] then epsilon determines a positive proportion of all k-simplices. In this paper, we give an improvement of this result in the case when epsilon is the Car ...

Elsevier Science Bv2017

Solving quantified linear arithmetic by counterexample-guided instantiation

Viktor Kuncak, Andrew Joseph Reynolds

This paper presents a framework to derive instantiation-based decision procedures for satisfiability of quantified formulas in first-order theories, including its correctness, implementation, and evaluation. Using this framework we derive decision procedur ...

2017

On The Exponent Of Distribution Of The Ternary Divisor Function

Philippe Michel

We show that the exponent of distribution of the ternary divisor function d(3) in arithmetic progressions to prime moduli is at least 1/2 + 1/46, improving results of Friedlander-Iwaniec and Heath-Brown. Furthermore, when averaging over a fixed residue cla ...

London Mathematical Society, Cambridge2015

Method and apparatus for low complexity spectral analysis of bio-signals

David Atienza Alonso, Andreas Peter Burg, Srinivasan Murali, Georgios Karakonstantis, Aviinaash Sankaranarayanan

A method and device for reducing the computational complexity of a processing algorithm, of a discrete signal, in particular of the spectral estimation and analysis of bio-signals, with minimum or no quality loss, which comprises steps of (a) choosing a do ...

2015

Equivalences between blocks of cohomological Mackey algebras

Baptiste Thierry Pierre Rognerud

Let G be a finite group and (K, O, k) be a p-modular system “large enough”. Let R = O or k. There is a bijection between the blocks of the group algebra RG and the central primitive idempotents (the blocks) of the so-called cohomological Mackey algebra coμ ...

Springer Verlag2015

A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings

Andrew Joseph Reynolds

We prove that the quantifier-free fragment of the theory of character strings with regular language membership constraints and linear integer constraints over string lengths is decidable. We do that by describing a sound, complete and terminating tableaux ...

Springer-Verlag Berlin2015

Equivalences between blocks of p-local Mackey algebras

Baptiste Thierry Pierre Rognerud

Let G be a finite group and (K, O, k) be a p-modular system. Let R = O or k. There is a bijection between the blocks of the group algebra and the blocks of the so-called p-local Mackey algebra mu(1)(R)(G). Let b be a block of RG with abelian defect group D ...

Elsevier2015

Faster ECC over $\mathbb{F}_{2^{521}-1}$

Robert Granger

In this paper we present a new multiplication algorithm for residues modulo the Mersenne prime

2^{521}−1

. Using this approach, on an Intel Haswell Core i7-4770, constant-time variable-base scalar multiplication on NIST’s (and SECG’s) curve P-521 requires ...

Springer Berlin Heidelberg2015

Trace maps for Mackey algebras

Baptiste Thierry Pierre Rognerud

Let G be a finite group and R be a commutative ring. The Mackey algebra μR(G) shares a lot of properties with the group algebra RG however, there are some differences. For example, the group algebra is a symmetric algebra and this is not always the case fo ...

Elsevier2015

Related publications (24)

2^{521}−1

. Using this approach, on an Intel Haswell Core i7-4770, constant-time variable-base scalar multiplication on NIST’s (and SECG’s) curve P-521 requires ...

Springer Berlin Heidelberg2015

Trace maps for Mackey algebras

Baptiste Thierry Pierre Rognerud

Elsevier2015