Publications associées (73)

K3 surfaces, cyclotomic polynomials and orthogonal groups

Eva Bayer Fluckiger

Let X be a complex projective K3 surface and let T-X be its transcendental lattice; the characteristic polynomials of isometries of T-X induced by automorphisms of X are powers of cyclotomic polynomials. Which powers of cyclotomic polynomials occur? The ai ...
Springer Int Publ Ag2024

FENNECS: a novel particle-in-cell code for simulating the formation of magnetized non-neutral plasmas trapped by electrodes of complex geometries

Stefano Alberti, Jean-Philippe Hogge, Joaquim Loizu Cisquella, Jérémy Genoud, Francesco Romano

This paper presents the new 2D electrostatic particle-in-cell code FENNECS de- veloped to study the formation of magnetized non-neutral plasmas in geometries with azimuthal symmetry. This code has been developed in the domain of gy- rotron electron gun des ...
2024

Algebraic and Boolean Methods for SFQ Superconducting Circuits

Giovanni De Micheli, Alessandro Tempia Calvino

Rapid single-flux quantum (RSFQ) is one of the most advanced and promising superconducting logic families, offering exceptional energy efficiency and speed. RSFQ technology requires delay registers (DFFs) and splitter cells to satisfy the path-balancing an ...
2024

Small-argument analytical expressions for the calculation of the ground-return impedance and admittance of underground cables

Rafael Silva Alipio

This paper proposes small-argument approximations for two closed-form equations that were recently derived for the calculation of the ground-return impedance and admittance of underground cables. The proposed expressions are shown to be accurate up to 1 MH ...
ELSEVIER SCIENCE SA2023

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Adam Teodor Polak, Alexandra Anna Lassota

We solve the Bin Packing problem in O^*(2^k) time, where k is the number of items less or equal to one third of the bin capacity. This parameter measures the distance from the polynomially solvable case of only large (i.e., greater than one third) items. O ...
Schloss Dagstuhl – Leibniz-Zentrum fur Informatik2022

Admissibility of Uncertain Injections in Quadratic Algebraic Systems

Jean-Yves Le Boudec, Cong Wang, Eleni Stai

We study the admissibility problem in multivariate algebraic systems, such as ac electrical networks, where the power injection is quadratic in the state. The goal of such systems is to ensure that the state stays in some security set (e.g., magnitudes of ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

A Local Law for Singular Values from Diophantine Equations

Marius Christopher Lemm

We introduce the N×NN\times N random matrices Xj,k=exp(2πiq=1d ωj,qkq)with {ωj,q}1jN1qd i.i.d. random variables,X_{j,k}=\exp\left(2\pi i \sum_{q=1}^d\ \omega_{j,q} k^q\right) \quad \text{with } \{\omega_{j,q}\}_{\substack{1\leq j\leq N\\ 1\leq q\leq d}} \text{ i.i.d. random variables}, and dd a fixed integer. We pr ...
2020

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.