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 ...
The corner transfer matrix renormalization group (CTMRG) algorithm has been extensively used to investigate both classical and quantum two-dimensional (2D) lattice models. The convergence of the algorithm can strongly vary from model to model depending on ...
Although W. L. Bragg's law can be easily derived for beginners in the field of crystallography, its interpretation however seems to cause some difficulties which lies essentially in the relation between the concept of lattice planes and the unit cell const ...
We characterize the irreducible polynomials that occur as the characteristic polynomial of an automorphism of an even unimodular lattice of a given signature, generalizing a theorem of Gross and McMullen. As part of the proof, we give a general criterion i ...
Surface stress drives long-range elastocapillary interactions at the surface of compliant solids, where it has been observed to mediate interparticle interactions and to alter the transport of liquid drops. We show that such an elastocapillary interaction ...
We study the Neel to fourfold columnar valence bond solid (cVBS) quantum phase transition in a sign-free S = 1 square-lattice model. This is the same kind of transition that for S = 1/2 has been argued to realize the prototypical deconfined critical point. ...
We consider the phase diagram of the most general SU(4)-symmetric two-site Hamiltonian for a system of two fermions per site (i.e., self-conjugate 6 representation) on the square lattice. It is known that this model hosts magnetic phases breaking SU(4) sym ...
We consider a random Gaussian ensemble of Laplace eigenfunctions on the 3D torus, and investigate the 1-dimensional Hausdorff measure ('length') of nodal intersections against a smooth 2-dimensional toral sub-manifold ('surface'). A prior result of ours pr ...
In a seminal work, Micciancio and Voulgaris (SIAM J Comput 42(3):1364-1391, 2013) described a deterministic single-exponential time algorithm for the closest vector problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given ...
We provide a process on the space of collections of coalescing cadlag stable paths and show convergence in an appropriate topology for coalescing stable random walks on the integer lattice. ...
