Related papers: Counterexample to the $l$-modular Belfiore-Sol\'e …

Weber's conjecture (1886) governs three aspects of lattice-based cryptography: the solvability of the Principal Ideal Problem, the freeness of modules over rings of integers, and the tightness of worst-case-to-average-case reductions in…

We study higher rank Jacobi partial and false theta functions (generalizations of the classical partial and false theta functions) associated to positive definite rational lattices. In particular, we focus our attention on certain Kostant's…

We prove an asymptotic formula with a power saving error term for the fourth moment of the family of Dirichlet $L$-functions to modulus $q$ mollified by a Dirichlet polynomial of length $q^{\frac1{22}-\ve}$, valid for all moduli…

Following the prequel work \cite{VO3}, we prove a generalization of "Mazur's conjecture" for $L$-functions of elliptic curves in abelian extensions of imaginary quadratic fields, including the assertion that the Mordell-Weil rank of an…

We consider two classic problems: maximum coverage and monotone submodular maximization subject to a cardinality constraint. [Nemhauser--Wolsey--Fisher '78] proved that the greedy algorithm provides an approximation of $1-1/e$ for both…

The problem of maximizing nonnegative monotone submodular functions under a certain constraint has been intensively studied in the last decade, and a wide range of efficient approximation algorithms have been developed for this problem.…

Let $q$ be a large prime, and $\chi$ the quadratic character modulo $q$. Let $\phi$ be a self-dual Hecke--Maass cusp form for $SL(3,\mathbb{Z})$, and $u_j$ a Hecke--Maass cusp form for $\Gamma_0(q)\subseteq SL(2,\mathbb{Z})$ with spectral…

We show that the subgroup lattice of any finite group satisfies Frankl's Union-Closed Conjecture. We show the same for all lattices with a modular coatom, a family which includes all supersolvable and dually semimodular lattices. A common…

Recent work characterizing the optimal performance of secrecy systems has made use of a distortion-like metric for partial secrecy as a replacement for the more traditional metric of equivocation. In this work we use the log-loss function…

We prove the $l^2$ Decoupling Conjecture for compact hypersurfaces with positive definite second fundamental form and also for the cone. This has a wide range of important consequences. One of them is the validity of the Discrete…

Coincidence Site Lattices (CSLs) are a well established tool in the theory of grain boundaries. For several lattices up to dimension $d=4$, the CSLs are known explicitly as well as their indices and multiplicity functions. Many of them…

For a modular lattice $L$ of finite length, we prove that the distributivity of $L$ is a sufficient condition while its 2-distributivity is a necessary condition that those sublattices of $L$ that are closed under taking relative…

We extend the CDPR lattice reduction algorithm from ideal to module lattices, leveraging the trace orthogonality of the power basis to decompose the module into rank-1 submodules and applying CDPR independently to each. This base module…

Let $k$ be an algebraically closed field. Fix integers $n$ and $b$ with $n\geq 3$ and $1\leq b\leq n-1.$ Let $T^d_k$ be the moduli space of hypersurfaces $[F]$ in $\mathbb{P}^n_k$ of degree $l$ whose singular locus contains a subscheme of…

De Bruijn and Newman introduced a deformation of the completed Riemann zeta function $\zeta$, and proved there is a real constant $\Lambda$ which encodes the movement of the nontrivial zeros of $\zeta$ under the deformation. The Riemann…

Optimization problems with set submodular objective functions have many real-world applications. In discrete scenarios, where the same item can be selected more than once, the domain is generalized from a 2-element set to a bounded integer…

We conjecture the true rate of growth of the maximum size of the Riemann zeta function and other $L$-functions. We support our conjecture using arguments from random matrix theory, conjectures for moments of $L$-functions, and also by…

A Banaschewski function on a bounded lattice L is an antitone self-map of L that picks a complement for each element of L. We prove a set of results that include the following: (1) Every countable complemented modular lattice has a…

The optimization of submodular functions on the integer lattice has received much attention recently, but the objective functions of many applications are non-submodular. We provide two approximation algorithms for maximizing a…

Given an $m\times n$ binary matrix $M$ with $|M|=p\cdot mn$ (where $|M|$ denotes the number of 1 entries), define the discrepancy of $M$ as $\mbox{disc}(M)=\displaystyle\max_{X\subset [m], Y\subset [n]}\big||M[X\times Y]|-p|X|\cdot…