Euclidean lattices are mathematical objects of increasing interest in the fields of cryptography and error-correcting codes. This doctoral thesis is a study on high-dimensional lattices with the motivation to understand how efficient they are in terms of b ...
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. By means of a suitably defined duality, new correspondence functors are constructed, having remarkable p ...
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) ...
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 ...
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 ...
It is known that the pitchfork bifurcation of Kelvin-Helmholtz instability occurring at minimum gradient Richardson number Ri(m) similar or equal to 1/4 in viscous stratified shear flows can be subcritical or supercritical depending on the value of the Pra ...
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 ...
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 ...
An integer program (IP) is a problem of the form min{f(x):Ax=b,l≤x≤u,x∈Zn}, where A∈Zm×n, b∈Zm, l,u∈Zn, and f:Zn→Z is a separable convex objective function.
The problem o ...
Over the past several years, non-ablative femtosecond laser exposure with spatially overlapping (i.e., spatially cumulative) pulses has emerged as a key process in three-dimensional writing of patterns in bulk of dielectric substrates. When temporally non- ...
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 ...
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 ...
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, ...
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 ...
Let P be a partially ordered set. The function La* (n, P) denotes the size of the largest family F subset of 2([n]) that does not contain an induced copy of P. It was proved by Methuku and Palvolgyi that there exists a constant C-P (depending only on P) su ...
As part of the study of correspondence functors, the present paper investigates their tensor product and proves some of its main properties. In particular, the correspondence functor associated to a finite lattice has the structure of a commutative algebra ...
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 ...
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 ...
A multifiltration is a functor indexed by Nr that maps any morphism to a monomorphism. The goal of this paper is to describe in an explicit and combinatorial way the natural Nr-graded R[x(1),...x(r)]-module structure on the homology of a multifiltration of ...
Let R be a unital commutative ring, and let M be an R-module that is generated by k elements but not less. Let be the subgroup of generated by the elementary matrices. In this paper we study the action of by matrix multiplication on the set of unimodular r ...
