Related papers: Lattices Without a Big Constant and With Noise
In this paper, we consider integral maximal lattice-free simplices. Such simplices have integer vertices and contain integer points in the relative interior of each of their facets, but no integer point is allowed in the full interior. In…
{\it Ab initio\} calculations have been successfully used for evaluating lattice dynamical properties of solids within the (quasi-)harmonic approximation (i.e., assuming non-interacting phonons with infinite lifetimes), but it remains…
Let us fix a prime $p$. The Erd\H{o}s-Ginzburg-Ziv problem asks for the minimum integer $s$ such that any collection of $s$ points in the lattice $\mathbb{Z}^n$ contains $p$ points whose centroid is also a lattice point in $\mathbb{Z}^n$.…
We apply classical and Bayesian lasso regularizations to a family of models with the presence of mixture and process variables. We analyse the performance of these estimates with respect to ordinary least squares estimators by a simulation…
Renormalization of composite fields is employed to suppress the statistical noise in lattice gauge calculations. We propose a new action which differs from the standard Wilson action by ''irrelevant'' operators, but suppresses the…
We present an approach to achieve zero modes in lattice models that do not rely on any symmetry or topology of the bulk, which are robust against disorder in the bulk of any type and strength. Such symmetry-free zero modes (SFZMs) are…
In this paper we consider the problem of linear unmixing hidden random variables defined over the simplex with additive Gaussian noise, also known as probabilistic simplex component analysis (PRISM). Previous solutions to tackle this…
We consider a tracer particle on a lattice in the presence of immobile obstacles. Starting from equilibrium, a force pulling on the particle is switched on, driving the system to a new stationary state. We solve for the complete transient…
The Fast Multipole Method (FMM) provides a highly efficient computational tool for solving constant coefficient partial differential equations (e.g. the Poisson equation) on infinite domains. The solution to such an equation is given as the…
We report recent progress in the study of a particular class of spin 1/2 XXZ model on two-dimensional lattices with frustrated diagonal and unfrustrated off-diagonal interactions. Quantum Monte Carlo simulations can be constructed without a…
We propose a novel method for building fuzzy clusters of large data sets, using a smoothing numerical approach. The usual sum-of-squares criterion is relaxed so the search for good fuzzy partitions is made on a continuous space, rather than…
Other than the commonly used Wilson's regularization of quantum field theories (QFTs), there is a growing interest in regularizations that explore lattice models with a strictly finite local Hilbert space, in anticipation of the upcoming…
We suggest simple modifications of the conditional gradient method for smooth optimization problems, which maintain the basic convergence properties, but reduce the implementation cost of each iteration essentially. Namely, we propose the…
We study in general algebras Gratzer's notion of congruence preserving function, characterizing functions in terms of stability under inverse image of particular Boolean algebras of subsets generated from any subset of the algebra.…
We propose an improvement of the differential method for the computation of the equation of state of QCD from lattice simulations. In contrast to the earlier differential method our technique yields positive pressure for all temperatures…
We employ the macroscopic fluctuation theory to study fluctuations of integrated current in one-dimensional lattice gases with a step-like initial density profile. We analytically determine the variance of the current fluctuations for a…
With the advance of large language models (LLMs), LLMs have been utilized for the various tasks. However, the issues of variability and reproducibility of results from each trial of LLMs have been largely overlooked in existing literature…
A subspace method is introduced to solve large-scale trace ratio problems. This approach is matrix-free, requiring only the action of the two matrices involved in the trace ratio. At each iteration, a smaller trace ratio problem is…
A lattice is a partially ordered set supporting a meet (or join) operation that returns the largest lower bound (smallest upper bound) of two elements. Just like graphs, lattices are a fundamental structure that occurs across domains…
This chapter considers the computational and statistical aspects of learning linear thresholds in presence of noise. When there is no noise, several algorithms exist that efficiently learn near-optimal linear thresholds using a small amount…