Publication
Idempotents in the endomorphism algebra of a finite lattice
Publications associées (32)
On the Mordell-Weil lattice of y(2) = x(3) + bx plus t(3n+1) in characteristic 3
We study the elliptic curves given by y(2) = x(3) + bx + t(3n+1) over global function fields of characteristic 3 ; in particular we perform an explicit computation of the L-function by relating it to the zeta function of a certain superelliptic curve u(3) ...
SPRINGER INT PUBL AG2022Intermolecular Pd(0)-Catalyzed Atropo-enantioselective C-H Arylation of Heteroarenes and Other Investigations into the Enantioselective Activation of Challenging C(sp3)-H Bonds
The direct construction of stereogenic axes by enantioselective C-H arylation has been regarded as a very challenging transformation. Very few examples have been reported, despite the indisputable straight-forwardness of the methodology. This is due to the ...
EPFL2021The algebra of Boolean matrices, correspondence functors, and simplicity
We determine the dimension of every simple module for the algebra of the monoid of all relations on a finite set (i.e. Boolean matrices). This is in fact the same question as the determination of the dimension of every evaluation of a simple correspondence ...
2020Packing the Boolean lattice with copies of a poset
The Boolean lattice (2[n],subset of) is the family of all subsets of [n]={1,MIDLINE HORIZONTAL ELLIPSIS,n}, ordered by inclusion. Let P be a partially ordered set. We prove that if n is sufficiently large, then there exists a packing P of copies of P in (2 ...
WILEY2020The covering radius and a discrete surface area for non-hollow simplices
We explore upper bounds on the covering radius of non-hollow lattice polytopes. In particular, we conjecture a general upper bound of d/2 in dimension d, achieved by the "standard terminal simplices" and direct sums of them. We prove this conjecture up to ...
2019Correspondence functors and lattices
A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. A main tool for this study is the construction of a correspondence functor associated to any finite latt ...
2019Construction of Polar Codes With Sublinear Complexity
Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli
Consider the problem of constructing a polar code of block length N for a given transmission channel W. Previous approaches require one to compute the reliability of the N synthetic channels and then use only those that are sufficiently reliable. However, ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019Simple and projective correspondence functors
A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. We determine exactly which simple correspondence functors are projective. We also determine which simple ...
2019Almost tiling of the Boolean lattice with copies of a poset
Let P be a partially ordered set. If the Boolean lattice (2[n],⊂) can be partitioned into copies of P for some positive integer n, then P must satisfy the following two trivial conditions: (1) the size of P is a power of 2, (2) P has a unique maximal and m ...
ELECTRONIC JOURNAL OF COMBINATORICS2018Splines Are Universal Solutions of Linear Inverse Problems with Generalized TV Regularization
Michaël Unser, Julien René Pierre Fageot, John Paul Ward
Splines come in a variety of flavors that can be characterized in terms of some differential operator L. The simplest piecewise-constant model corresponds to the derivative operator. Likewise, one can extend the traditional notion of total variation by con ...
2017