English
Related papers

Related papers: Sharp o-minimality and lattice point counting

200 papers

Downarowicz and Maass (2008) have shown that every Cantor minimal homeomorphism with finite topological rank $K > 1$ is expansive. Bezuglyi, Kwiatkowski, and Medynets (2009) extended the result to non-minimal aperiodic cases. In this paper,…

Dynamical Systems · Mathematics 2016-08-22 Takashi Shimomura

We present an algorithm for the exact computer-aided construction of the Voronoi cells of lattices with known symmetry group. Our algorithm scales better than linearly with the total number of faces and is applicable to dimensions beyond…

Information Theory · Computer Science 2025-10-28 Daniel Pook-Kolb , Bruce Allen , Erik Agrell

We study the problem of constructing explicit families of matrices which cannot be expressed as a product of a few sparse matrices. In addition to being a natural mathematical question on its own, this problem appears in various…

Computational Complexity · Computer Science 2019-04-03 Mrinal Kumar , Ben Lee Volk

A new finite lattice calculation of the low lying bound state energies in the massive Schwinger model is presented, using a Hamiltonian lattice formulation. The results are compared with recent analytic series calculations in the low mass…

High Energy Physics - Lattice · Physics 2009-10-31 P. Sriganesh , R. Bursill , C. J. Hamer

We study and simulate N=2 supersymmetric Wess-Zumino models in one and two dimensions. For any choice of the lattice derivative, the theories can be made manifestly supersymmetric by adding appropriate improvement terms corresponding to…

High Energy Physics - Lattice · Physics 2008-11-26 Georg Bergner , Tobias Kaestner , Sebastian Uhlmann , Andreas Wipf

We study weak approximation on rationally connected varieties under an assumption of strong approximation for a "simple" variety or under Schinzel's hypothesis. We also get some unconditional results.

Number Theory · Mathematics 2021-09-10 Dasheng Wei

The following two assertions are equivalent for an o-minimal expansion of an ordered group $\mathcal M=(M,<,+,0,\ldots)$. There exists a definable bijection between a bounded interval and an unbounded interval. Any definable continuous…

Logic · Mathematics 2023-05-17 Masato Fujita

In this article we introduce a new family of lattice polytopes with rational linear precision. For this purpose, we define a new class of discrete statistical models that we call multinomial staged tree models. We prove that these models…

Combinatorics · Mathematics 2022-08-10 Isobel Davies , Eliana Duarte , Irem Portakal , Miruna-Stefana Sorea

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…

Computational Complexity · Computer Science 2014-03-05 Daniel Dadush , Santosh Vempala

We prove that, under mild assumptions, a lattice in a product of semi-simple Lie group and a totally disconnected locally compact group is, in a certain sense, arithmetic. We do not assume the lattice to be finitely generated or the ambient…

Group Theory · Mathematics 2017-05-24 Uri Bader , Alex Furman , Roman Sauer

We investigate an integrable property and observables of 2 dimensional N=(4,4) topological field theory defined on a discrete lattice by using the "orbifolding" and "deconstruction" methods. We show that our lattice model possesses the…

High Energy Physics - Lattice · Physics 2008-11-26 Kazutoshi Ohta , Tomohisa Takimi

We exhibit algorithms for calculating Tits' buildings and orbits of vectors in a lattice $L$ for certain subgroups of $\operatorname{O}(L)$. We discuss how these algorithms can be applied to understand the configuration of boundary…

Algebraic Geometry · Mathematics 2024-07-19 Matthew Dawes

We provide a new class of Z_N x Z_M heterotic orbifolds on non-factorisable tori, whose boundary conditions are defined by Lie lattices. Generally, point groups of these orbifolds are generated by Weyl reflections and outer automorphisms of…

High Energy Physics - Theory · Physics 2009-11-13 Kei-Jiro Takahashi

We provide a compact data structure for representing polyominoes that supports neighborhood and visibility queries. Neighborhood queries concern reporting adjacent cells to a given cell, and visibility queries determine whether a straight…

Data Structures and Algorithms · Computer Science 2023-11-29 Magnus Berg , Shahin Kamali , Katherine Ling , Cooper Sigrist

We study results related to a conjecture formulated by Strohmer and Beaver about optimal Gaussian Gabor frame set-ups. Our attention will be restricted to the case of Gabor systems with standard Gaussian window and rectangular lattices of…

Functional Analysis · Mathematics 2020-12-11 Markus Faulhuber

We give upper bounds on the minimal degree of a model in $\mathbb{P}^2$ and the minimal bidegree of a model in $\mathbb{P}^1 \times \mathbb{P}^1$ of the curve defined by a given Laurent polynomial, in terms of the combinatorics of the…

Combinatorics · Mathematics 2015-05-22 Wouter Castryck , Filip Cools

Given a lattice $\Lambda \subset \mathbb{R}^n$, we consider its Minkowski reduced basis and the solid angle $\Omega$ spanned by the basis vectors. Such a basis satisfies strong near-orthogonality conditions, which allow us to bound from…

Metric Geometry · Mathematics 2017-03-02 Danny Nguyen

We introduce a class of countable groups by some abstract group-theoretic conditions. It includes linear groups with finite amenable radical and finitely generated residually finite groups with some non-vanishing $\ell^2$-Betti numbers that…

Group Theory · Mathematics 2018-07-20 Uri Bader , Alex Furman , Roman Sauer

Given a number field K, we consider families of critically separable rational maps of degree d over K possessing a certain fixed-point and multiplier structure. With suitable notions of isomorphism and good reduction between rational maps…

Number Theory · Mathematics 2019-02-20 Clayton Petsche

In this paper we describe an algorithm that quickly computes a maximal a-valued lattice in an F-vector space equipped with a non-degenerate bilinear form, where a is a fractional ideal in a number field F. We then apply this construction to…

Number Theory · Mathematics 2012-10-26 Jonathan Hanke