Related papers: Bykovskii's theorem and generalized Larcher's theo…
The present study provides another look on Lamperti's theorem on recurrence or transience of stochastic sequences. We establish connection between Lamperti's theorem and the recent result by the author [V. M. Abramov, Theor. Probab. Math.…
We consider the problem of interpolating functions partially defined over a distributive lattice, by means of lattice polynomial functions. Goodstein's theorem solves a particular instance of this interpolation problem on a distributive…
In this note, we derive an asymptotically sharp upper bound on the number of lattice points in terms of the volume of centrally symmetric convex bodies. Our main tool is a generalization of a result of Davenport that bounds the number of…
In this paper, we demonstrate that Li's fixed point theorems are indeed equivalent with the primitive Caristi's fixed point theorem, Jachymski's fixed point theorems, Feng and Liu's fixed point theorems, Khamsi's fixed point theorems and…
We study the Hadwiger-Alesker finiteness theorem from the standpoint of Lie theory and announce a generalization.
In this note we point out the relation between Brion's formula for the lattice point generating function of a convex polytope in terms of the vertex cones [Brion1988] on the one hand, and the polar decomposition \`a la Lawrence/Varchenko…
We prove that every finite distributive lattice $D$ can be represented as the congruence lattice of a rectangular lattice $K$ in which all congruences are principal. We verify this result in a stronger form as an extension theorem.
The aim of this note is to give a proof of the Schottky theorem in general domains in $\mathbb{C}^n$. The proof is short and works for the cases $n = 1$ and $n > 1$ at the same time.
We consider the lattice point problem corresponding to a family of elliptic paraboloids in $\mathbb{R}^d$ with $d\ge3$ and we prove the expected to be optimal exponent, improving previous results. This is especially noticeable for $d=3$…
In this short paper we prove a quantitative version of the Khintchine-Groshev Theorem with congruence conditions. Our argument relies on a classical argument of Schmidt on counting generic lattice points, which in turn relies on a certain…
In this note, we combine ideas of several previous proofs in order to obtain a quite short proof of Gr\"otzsch theorem.
Minkowski's second theorem on successive minima asserts that the volume of a 0-symmetric convex body K over the covolume of a lattice \Lambda can be bounded above by a quantity involving all the successive minima of K with respect to…
In this paper we investigate iteration of maps on lattices and the corresponding polynomial-like iterative equation. Since a lattice need not have a metric space structure, neither the Schauder fixed point theorem nor the Banach fixed point…
We prove some new results related to Tanaka's formula.
A unified classification and analysis is presented of two dimensional Dirac operators of QCD-like theories in the continuum as well as in a naive lattice discretization. Thereby we consider the quenched theory in the strong coupling limit.…
We give a simple proof of Dorronsoro's theorem and use similar ideas to establish an equivalence for embeddings of vector fields.
In this paper we go on to discuss about Stanley's theorem in Integer partitions. We give two different versions for the proof of the generalization of Stanley's theorem illustrating different techniques that may be applied to profitably…
Motivated by representation theory and geometry, we introduce and develop an equivariant generalization of Ehrhart theory, the study of lattice points in dilations of lattice polytopes. We prove representation-theoretic analogues of…
The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length $n$ with flaws $m$ is the $n$-th Catalan number and independent on $m$. L. Shapiro [7] found the Chung-Feller properties for the Motzkin paths. In this…
Three generalizations of the well-known Ceva's Theorem are given in this paper and some applications.