Related papers: Bykovskii's theorem and generalized Larcher's theo…
We extend the local well-posedness theory for the Cauchy problem associated to a degenerated Zakharov system. The new main ingredients are the derivation of Strichartz and maximal function norm estimates for the linear solution of a…
A generalization of the law of total covariance is presented and proved.
In this paper, we give a counter-example, in the general case, Kronecker theorem will derive contradiction. Kronecker theorem be correct after removing some conditions.
Using the classical Lazard's elimination theorem, we obtain a decomposition theorem for Lie algebras defined by generators and relations of a certain type. This is a preprint version of the paper appearing in Communications in Algebra…
We revisit Schnorr's lattice-based integer factorization algorithm, now with an effective point of view. We present effective versions of Theorem 2 of Schnorr's "Factoring integers and computing discrete logarithms via diophantine…
We study the Ehrhart theory of quadratic irrational polytopes that undergo vector dilations. That is, for a given polytope with vertices in $\mathbb{Q}(\sqrt{D})$, and a different dilation factor for each facet, we show that the leading…
The main result of this paper is an inequality relating the lattice point enumerator of a 3-dimensional, 0-symmetric convex body and its successive minima. This is an example of generalization of Minkowski's theorems on successive minima,…
We provide conditions for a lattice scheme defined on a four points lattice to be linearizable by a point transformation. We apply the obtained conditions to a symmetry preserving difference scheme for the potential Burgers introduced by…
Two lattice points are visible to one another if there exist no other lattice points on the line segment connecting them. In this paper we study convex lattice polygons that contain a lattice point such that all other lattice points in the…
The Minkowski length of a lattice polytope $P$ is a natural generalization of the lattice diameter of $P$. It can be defined as the largest number of lattice segments whose Minkowski sum is contained in $P$. The famous Ehrhart theorem…
We investigate the representation of lattices as sublattices of the lattice of all convex subsets (intervals) of a linearly ordered set $(X,\le)$. We introduce the purely lattice-theoretic notion of a \textit{loc-lattice} and prove that…
In the paper [V. Adler, IMRN {\bf 1} (1998) 1--4] a lattice version of the Krichever-Novikov equation was constructed. We present in this note its Lax pair and discuss its elliptic form.
We give an elementary proof of a Landesman-Lazer type result for systems by means of a shooting argument and explore its connection with the fundamental theorem of algebra.
$ \newcommand{\R}{\mathbb{R}} \newcommand{\lat}{\mathcal{L}} $We prove a conjecture due to Dadush, showing that if $\lat \subset \R^n$ is a lattice such that $\det(\lat') \ge 1$ for all sublattices $\lat' \subseteq \lat$, then \[ \sum_{\vec…
We introduce a new type of mappings in metric space which are three-point analogue of the well-known Chatterjea type mappings, and call them generalized Chatterjea type mappings. It is shown that such mappings can be discontinuous as is the…
Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.
We prove a generalization of Tur\'{a}n's theorem proposed by Balogh and Lidick\'{y}.
A simple convex lattice polytope $\Box$ defines a torus-equivariant line bundle $\LB$ over a toric variety $\XB.$ Atiyah and Bott's Lefschetz fixed-point theorem is applied to the torus action on the $d''$-complex of $\LB$ and information…
Any configuration of lattice vectors gives rise to a hierarchy of higher-dimensional configurations which generalize the Lawrence construction in geometric combinatorics. We prove finiteness results for the Markov bases, Graver bases and…
We prove that every lattice with more than one element has a proper congruence-preserving extension.