Related papers: Sharper Bounds on Four Lattice Constants
In this article, we prove the restriction theorem for the Fourier-Hermite transform and obtain the Strichartz estimate for the system of orthonormal functions for the Hermite operator $H=-\Delta+|x|^2$ on $\mathbb{R}^n$ as application.…
We present a novel framework for the development of fourth-order lattice Boltzmann schemes to tackle multidimensional nonlinear systems of conservation laws. As for other numerical schemes for hyperbolic problems, high-order accuracy…
We propose generalized equilibria of a three-dimensional color-gradient lattice Boltzmann model for two-component two-phase flows using higher-order Hermite polynomials. Although the resulting equilibrium distribution function, which…
PBZ*-lattices are bounded lattice-ordered structures endowed with two complements, called Kleene and Brouwer; by definition, they are the paraorthomodular Brouwer-Zadeh lattices in which the pairs of elements with their Kleene complements…
This paper reports the investigations done to adapt the Characteristic Boundary Conditions (CBC) to the Lattice-Boltzmann formalism for high Reynolds number applications. Three CBC formalisms are implemented and tested in an open source LBM…
An open problem that is widely regarded as one of the most important in quantum query complexity is to resolve the quantum query complexity of the k-distinctness function on inputs of size N. While the case of k=2 (also called Element…
Kolla and Tulsiani [KT07,Kolla11} and Arora, Barak and Steurer [ABS10] introduced the technique of subspace enumeration, which gives approximation algorithms for graph problems such as unique games and small set expansion; the running time…
We study a systematic improvement of perturbation theory for gauge fields on the lattice; the improvement entails resumming, to all orders in the coupling constant, a dominant subclass of tadpole diagrams. This method, originally proposed…
We give a sharp lower bound on the capacity of a real stable polynomial, depending only on the value of its gradient at $x = 1$. This result implies a sharp improvement to a similar inequality proved by Linial-Samorodnitsky-Wigderson in…
We develop a reinforcement learning pipeline for simplifying knot diagrams. A trained agent learns move proposals and a value heuristic for navigating Reidemeister moves. The pipeline applies to arbitrary knots and links; we test it on…
We optimized the implicit constant for the refined upper bounds for moments of the Riemann zeta-function proved by Harper. We also computed the implicit constant for the upper bounds for moments of the Riemann zeta-function proved by…
Let lambda_s(n) denote the maximum length of a Davenport-Schinzel sequence of order s on n symbols. For s=3 it is known that lambda_3(n) = Theta(n alpha(n)) (Hart and Sharir, 1986). For general s>=4 there are almost-tight upper and lower…
The aim of this paper is to study lattice properties of the sharp partial order for complex matrices having index at most 1. We investigate the down-set of a fixed matrix $B$ under this partial order via isomorphisms with two different…
Complex bases, along with direct-sums defined by rings of imaginary quadratic integers, induce algebraic lattices. In this work, we study such lattices and their reduction algorithms. Firstly, when the lattice is spanned over a two…
We improve the best known upper bound on the length of the shortest reset words of synchronizing automata. The new bound is slightly better than $114 n^3 / 685 + O(n^2)$. The \v{C}ern\'y conjecture states that $(n-1)^2$ is an upper bound.…
The Lipschitz constant plays a crucial role in certifying the robustness of neural networks to input perturbations. Since calculating the exact Lipschitz constant is NP-hard, efforts have been made to obtain tight upper bounds on the…
We obtain a power saving in the error term for a semigroup congruence lattice point count related to continued fractions. This is done by adapting arguments from recent work of Oh and Winter (2014) that give uniform bounds for certain…
This paper considers the problem of unconstrained minimization of smooth convex functions having Lipschitz continuous gradients with known Lipschitz constant. We recently proposed an optimized gradient method (OGM) for this problem and…
We discuss testing improved actions in the context of finite volume gauge theories, where both results for the continuum and the Wilson lattice action are known analytically for volumes up to 0.7 fermi across. A new improved action is…
We introduce an alternative discretization for static quarks on the lattice retaining the O(a) improvement properties of the Eichten-Hill action. In this formulation, statistical fluctuations are reduced by a factor which grows…