Related papers: Counting Lattice Animals in High Dimensions

In this paper, we study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+\varepsilon)$-approximation algorithm with $O(n+ 1/\varepsilon^{d-1})$…

The lattice size of a lattice polytope $P$ was defined and studied by Schicho, and Castryck and Cools. They provided an "onion skins" algorithm for computing the lattice size of a lattice polygon $P$ in $\mathbb{R}^2$ based on passing…

This paper examines the problem of locating outlier columns in a large, otherwise low-rank, matrix. We propose a simple two-step adaptive sensing and inference approach and establish theoretical guarantees for its performance; our results…

We prove a uniform upper and lower bound for Delannoy numbers. This is achieved by using the representation of Delannoy numbers as the number of lattice points in high-dimensional cross-polytopes (also known as hyper-octahedrons or $\ell^1$…

We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.

Elliptical factor models play a central role in modern high-dimensional data analysis, particularly due to their ability to capture heavy-tailed and heterogeneous dependence structures. Within this framework, Tyler's M-estimator (Tyler,…

We present a Monte Carlo method that allows efficient and unbiased sampling of Hamiltonian walks on a cubic lattice. Such walks are self-avoiding and visit each lattice site exactly once. They are often used as simple models of globular…

This paper deals with lattices $(L,\Vert~\Vert)$ over polynomial rings, where $L$ is a finitely generated module over $k[t]$, the polynomial ring over the field $k$ in the indeterminate $t$, and $\Vert~\Vert$ is a discrete real-valued…

The effect of rotational constraint on the properties of lattice models like the self-avoiding walk, lattice animals and percolation is discussed. The results obtained so far, using a variety of exact and approximate techniques, are…

Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…

The assessment of laboratory animal behavior is of central interest in modern neuroscience research. Behavior is typically studied in terms of pose changes, which are ideally captured in three dimensions. This requires triangulation over a…

We give a deterministic 2^{O(n)} algorithm for computing an M-ellipsoid of a convex body, matching a known lower bound. This has several interesting consequences including improved deterministic algorithms for volume estimation of convex…

For a positive integer $d$, the $d$-dimensional Chebyshev-Frolov lattice is the $\mathbb{Z}$-lattice in $\mathbb{R}^d$ generated by the Vandermonde matrix associated to the roots of the $d$-dimensional Chebyshev polynomial. It is important…

Feller's book An Introduction to Probability Theory and Its Application discusses statistics corresponding to sequences of coin tosses, with a dollar being won or lost depending on the outcome of each toss. This is equivalent to analyzing…

In this paper, we enumerate lattice paths with certain constraints and apply the corresponding results to develop formulas for calculating the dimensions of submodules of a class of modules for planar upper triangular rook monoids. In…

This paper introduces a new method for the efficient computation of oscillatory multidimensional lattice sums in geometries with boundaries. Such sums are ubiquitous in both pure and applied mathematics, and have immediate applications in…

We present an efficient, elastic 3D LiDAR reconstruction framework which can reconstruct up to maximum LiDAR ranges (60 m) at multiple frames per second, thus enabling robot exploration in large-scale environments. Our approach only…

Large N gauge theories with adjoint matter can be numerically studied using lattice techniques. Eguchi-Kawai reductions holds for this theory and one can reduce the lattice model to a single site. Hybrid Monte Carlo algorithm can be used to…

We have developed a parallel algorithm that allows us to enumerate the number of self-avoiding polygons on the square lattice to perimeter length 110. We have also extended the series for the first 10 area-weighted moments and the radius of…

This paper provides the theoretical foundation for the construction of lattice algorithms for multivariate $L_2$ approximation in the worst case setting, for functions in a periodic space with general weight parameters. Our construction…