Concept

Eisenstein integer

Related publications (55)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

CM values of higher Green's functions and regularized Petersson products

Maryna Viazovska

Higher Green functions are real-valued functions of two variables on the upper half-plane, which are bi-invariant under the action of a congruence subgroup, have a logarithmic singularity along the diagonal, and satisfy the equation f = k(1−k) f ; here i ...

Cambridge UP2015

Cross-Intersecting Families of Vectors

János Pach, Gábor Tardos

Given a sequence of positive integers , let denote the family of all sequences of positive integers such that for all . Two families of sequences (or vectors), , are said to be -cross-intersecting if no matter how we select and , there are at least distinc ...

Springer Japan Kk2015

Sound reasoning about integral data types with a reusable SMT solver interface

Viktor Kuncak, Régis William Blanc

We extend the Leon verification system for Scala with support for bit-vector reasoning, thus addressing one of its fundamental soundness limitation with respect to the treatment of integers primitives. We leverage significant progresses recently achieved i ...

ACM Press2015

Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex

Jan Kyncl

We estimate the selection constant in the following geometric selection theorem by Pach: For every positive integer d, there is a constant such that whenever are n-element subsets of , we can find a point and subsets for every , each of size at least , suc ...

Springer2015

Analysis of Quantized Electrical Characteristics of Microscale TiO2 Ink-Jet Printed Memristor

Heinrich Hofmann, Marijana Mionic Ebersold, Goran Stojanovic

We demonstrate the ink-jet printed fabrication technique for TiO2-based memristor, followed by detailed analysis of electrical characteristics and development of a new model that considers observed phenomena of quantized conductance steps. The existence of ...

Institute of Electrical and Electronics Engineers2015

Algebraic Trace Functions Over The Primes

Philippe Michel

We study sums over primes of trace functions of l-adic sheaves. Using an extension of our earlier results on algebraic twists of modular forms to the case of Eisenstein series and bounds for Type II sums based on similar applications of the Riemann hypothe ...

Duke Univ Press2014

An extremal problem on crossing vectors

Bartosz Maria Walczak, Michal Lason

For positive integers w and k, two vectors A and B from Z(w) are called k-crossing if there are two coordinates i and j such that A[i] - B[i] >= k and B[j] - A[j] >= k. What is the maximum size of a family of pairwise 1-crossing and pairwise non-k-crossing ...

Academic Press Inc Elsevier Science2014

On The Image Of The Almost Strict Morse N-Category Under Almost Strict N-Functors

In an earlier work, we constructed the almost strict Morse n-category X which extends Cohen Sz Jones Sz Segal's flow category. In this article, we define two other almost strict n-categories V and W where V is based on homomorphisms between real vector spa ...

Mount Allison University2014

Compute-and-Forward: Finding the Best Equation

Michael Christoph Gastpar, Saeid Sahraei

Compute-and-Forward is an emerging technique to deal with interference. It allows the receiver to decode a suitably chosen integer linear combination of the transmitted messages. The integer coefficients should be adapted to the channel fading state. Optim ...

2014

Gaussian (dirty) multiple access channels: a compute-and-forward perspective

Michael Christoph Gastpar, Jingge Zhu

Lattice codes are applied to the two-user Gaussian multiple access channel (MAC) combined with a modified compute-and-forward transmitting scheme. It is shown that non-corner points on the boundary of the capacity region can be achieved by decoding two int ...

IEEE2014