English
Related papers

Related papers: Lonely Points in Simplices

200 papers

After giving a short introduction on smooth lattice polytopes, I will present a proof for the finiteness of smooth lattice polytopes with few lattice points. The argument is then turned into an algorithm for the classification of smooth…

Combinatorics · Mathematics 2010-01-05 Benjamin Lorenz

The bad locus and the rude locus of an ample and base point free linear system on a smooth complex projective variety are introduced and studied. The bad locus is defined as the set of points that force divisors through them to be…

Algebraic Geometry · Mathematics 2007-05-23 Gian Mario Besana , Sandra Di Rocco , Antonio Lanteri

The local $h^*$-polynomial is a natural invariant of a lattice polytope appearing in Ehrhart theory and Hodge theory. In this work, we study the question posed in [GKZ94] concerning the classification of lattice simplices with vanishing…

Combinatorics · Mathematics 2025-12-23 Vadym Kurylenko

A discrete set in the Euclidian space is almost periodic, if the measure with the unite masses at points of the set is almost periodic in the weak sense. We prove the following result: if A is a discrete almost periodic set and the set A-A…

Complex Variables · Mathematics 2010-04-02 Sergei Favorov

An asymptotic formula is presented for the number of planar lattice convex polygonal lines joining the origin to a distant point of the diagonal. The formula involves the non-trivial zeros of the zeta function and leads to a necessary and…

Probability · Mathematics 2016-12-13 Julien Bureaux , Nathanaël Enriquez

We demonstrate existence of solitary waves of synchrony in one-dimensional arrays of identical oscillators with Laplacian coupling. Coarse-grained description of the array leads to nonlinear equations for the complex order parameter, in the…

Pattern Formation and Solitons · Physics 2019-01-02 L. A. Smirnov , G. V. Osipov , A. Pikovsky

We introduce and study a family of lattice equations which may be viewed either as a strongly nonlinear discrete extension of the Gardner equation, or a non-convex variant of the Lotka-Volterra chain. Their deceptively simple form supports…

Pattern Formation and Solitons · Physics 2021-08-11 Philip Rosenau , Arkady Pikovsky

For a given finite subset P of points of the lattice Z^2, a friendly path is a monotone (uphill or downhill) lattice path which splits points in half; points lying on the path itself are discarded. The purpose of this paper (and its sequel)…

Combinatorics · Mathematics 2024-02-06 Giedrius Alkauskas

In this paper we shall prove that the singular locus of a symplectic singularity has no codimension 3 irreducible components. As a corollary, a symplectic singularity is terminal if and only if its singular locus has codimension $\geq 4$.…

Algebraic Geometry · Mathematics 2007-05-23 Yoshinori Namikawa

Consider an analytical function $f:V\subset\mathbb R^2\rightarrow\mathbb R$ having $0$ as its regular value, a switching manifold $\Sigma=f^{-1}(0)$ and a piecewise analytical vector field $X=(X^+,X^-)$, i.e. $X^\pm$ are analytical vector…

Dynamical Systems · Mathematics 2023-02-21 Claudio Buzzi , João Carlos Medrado , Claudio Pessoa

Let $C$ be a curve defined over a number field $k$. We say a closed point $x\in C$ of degree $d$ is isolated if it does not belong to an infinite family of degree $d$ points parametrized by the projective line or a positive rank abelian…

Number Theory · Mathematics 2020-06-29 Abbey Bourdon , David R. Gill , Jeremy Rouse , Lori D. Watson

We prove a remarkable combinatorial symmetry in the number of spanning configurations in site percolation: for a large class of lattices, the number of spanning configurations with an odd or even number of occupied sites differs by $\pm 1$.…

Statistical Mechanics · Physics 2019-12-11 Stephan Mertens , Cristopher Moore

For a modular lattice $L$ of finite length, we prove that the distributivity of $L$ is a sufficient condition while its 2-distributivity is a necessary condition that those sublattices of $L$ that are closed under taking relative…

Rings and Algebras · Mathematics 2022-01-19 Gábor Czédli

We study Knizhnik-Zamolodchikov (KZ) connection in the presence of irregular singularities, that is, poles of higher order. We consider both the case of a universal connection and the case when it is associated with a specific simple Lie…

High Energy Physics - Theory · Physics 2026-05-04 Xia Gu , Babak Haghighat , Pavel Putrov

We construct positive weak solutions of a class of semilinear elliptic equation which vanish in suitable trace sense on the boundary of a given smooth bounded N-dimensional domain, but which are singular at prescribed isolated points of the…

Analysis of PDEs · Mathematics 2007-05-23 Manuel del Pino , Monica Musso , Frank Pacard

This paper is devoted to introduce and investigate the notion of monotone sets in Hadamard spaces. First, flat Hadamard spaces are introduced and investigated. It is shown that an Hadamard space $X$ is flat if and only if $X\times…

Functional Analysis · Mathematics 2022-07-05 Ali Moslemipour , Mehdi Roohi

A space Y is called an extension of a space X if Y contains X as a dense subspace. An extension Y of X is called a one-point extension if Y-X is a singleton. Compact extensions are called compactifications and connected extensions are…

General Topology · Mathematics 2015-07-01 M. R. Koushesh

For $\Pi \subset \mathbb{R}^2$ a connected, open, bounded set whose boundary is a finite union of disjoint polygons whose vertices have integer coordinates, the logarithm of the discrete Laplacian on $L\Pi \cap \mathbb{Z}^2$ with Dirichlet…

Mathematical Physics · Physics 2023-04-19 Rafael Leon Greenblatt

Let $\sigma$ be the scattering relation on a compact Riemannian manifold $M$ with non-necessarily convex boundary, that maps initial points of geodesic rays on the boundary and initial directions to the outgoing point on the boundary and…

Differential Geometry · Mathematics 2007-05-23 Plamen Stefanov , Gunther Uhlmann

In this paper, we derive a Singleton bound for lattice schemes and obtain Singleton bounds known for binary codes and subspace codes as special cases. It is shown that the modular structure affects the strength of the Singleton bound. We…

Information Theory · Computer Science 2015-06-17 Srikanth B. Pai , B. Sundar Rajan