Related papers: Module Lattice Security (Part III): Structured CVP…

When macroscopic quantum condensates -- superconductors, superfluids, cold atoms and ions, polaritons etc. -- are put in rotation, a quantum vortex lattice forms inside. In homogeneous type-II superconductors, each vortex has a tiny core…

We report the results of a calculation of the K --> pi pi matrix elements relevant for the $\DIhalf$ rule and $\epe$ in quenched lattice QCD using domain wall fermions at a fixed lattice spacing $a^{-1} \sim 2$ GeV. Working in the…

Suppose that $M$ is a finitely-generated graded module of codimension $c\geq 3$ over a polynomial ring and that the regularity of $M$ is at most $2a-2$ where $a\geq 2$ is the minimal degree of a first syzygy of $M$. Then we show that the…

We introduce appropriate computable moduli of smoothness to characterize the rate of best approximation by multivariate polynomials on a connected and compact $C^2$-domain $\Omega\subset \mathbb{R}^d$. This new modulus of smoothness is…

In the modular symmetry approach to neutrino models, the flavour symmetry emerges as a finite subgroup $\Gamma_N$ of the modular symmetry, broken by the vacuum expectation value (VEV) of a modulus field $\tau$. If the VEV of the modulus…

Combining the ratio of experimental kaon and pion decay widths, Gamma(K to mu antineutrino{mu} (gamma)) / Gamma(pi to mu \antineutrino (gamma)), with a recent lattice gauge theory calculation of f{K}/f{pi} provides a precise value for the…

Spectra of suitably chosen Pisot-Vijayaraghavan numbers represent non-trivial examples of self-similar Delone point sets of finite local complexity, indispensable in quasicrystal modeling. For the case of quadratic Pisot units we…

The Quantum Modularity Conjecture of Zagier predicts the existence of a formal power series with arithmetically interesting coefficients that appears in the asymptotics of the Kashaev invariant at each root of unity. Our goal is to…

A code $C \colon \{0,1\}^k \to \{0,1\}^n$ is a $q$-locally decodable code ($q$-LDC) if one can recover any chosen bit $b_i$ of the message $b \in \{0,1\}^k$ with good confidence by randomly querying the encoding $x := C(b)$ on at most $q$…

It is a common problem in lattice QCD calculation of the mass of the hadron with an annihilation channel that the signal falls off in time while the noise remains constant. In addition, the disconnected insertion calculation of the…

For suitable classes of random Verblunsky coefficients, including independent, identically distributed, rotationally invariant ones, we prove that if \[ \mathbb{E} \biggl(\int\frac{d\theta}{2\pi} \biggl|\biggl(\frac{\mathcal{C} +…

We study the complexity of inverse cellular automata on configurations of bounded size. Deciding injectivity in this setting is co-NP-complete by a theorem of Durand. We give a simpler proof of this theorem by a direct reduction from UNSAT…

QCD at non-zero chemical potential ($\mu$) for quark number has a complex fermion determinant and thus standard simulation methods for lattice QCD cannot be applied. We therefore simulate this theory using the Complex-Langevin algorithm…

Suppose $\left \{ X_{i,k}; 1\le i \le p, 1\le k \le n \right \} $ is an array of i.i.d.~real random variables. Let $\left \{ p=p_{n}; n \ge1 \right \} $ be positive integers. Consider the maximum interpoint distance $M_{n}=\max_{1\le i<…

We present an extension of Voronoi diagrams where when considering which site a client is going to use, in addition to the site distances, other site attributes are also considered (for example, prices or weights). A cell in this diagram is…

Stable vortex states are studied in large superconducting thin disks (for numerical purposes we considered with radius R = 50 \xi). Configurations containing more than 700 vortices were obtained using two different approaches: the nonlinear…

This thesis explores algorithmic applications and limitations of convex relaxation hierarchies for approximating some discrete and continuous optimization problems. - We show a dichotomy of approximability of constraint satisfaction…

We develop a unified framework to characterize the power of higher-level algorithms for the constraint satisfaction problem (CSP), such as $k$-consistency, the Sherali-Adams LP hierarchy, and the affine IP hierarchy. As a result,…

We develop a representation theoretic technique for detecting closed orbits that is applicable in all characteristics. Our technique is based on Kempf's theory of optimal subgroups and we make some improvements and simplify the theory from…

Let $A \in \mathbb{R}^{n \times (n - d)}$ be a random matrix with independent uniformly anti-concentrated entries satisfying $\mathbb{E}\lvert A\rvert_{HS}^2 \leq Kn(n-d)$ and let $H$ be the subspace spanned by the columns of $A$. Let $X…