Related papers: Isometries of lattices and Hasse principles
The problem of computing the index of a coincidence isometry of the hyper cubic lattice $\mathbb{Z}^{n}$ is considered. The normal form of a rational orthogonal matrix is analyzed in detail, and explicit formulas for the index of certain…
We study D\'iaz-Dineen's problem for regular homogeneous vector-valued polynomials. In particular, we prove that if $E^*$ and $F^*$ are lattice isomorphic with at least one having order continuous norm, then $\mathcal{P}^r(^n E; G^*)$ and…
We prove several rigorous results about the asymptotic behaviour of the numbers of tadpoles (or lassos) embedded in a lattice, including cases where the head is subject to a constraint like being unknotted, or where the tail pierces the…
For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough symmetry, we can construct a provably deterministic polynomial-time algorithm to accomplish…
We show that for an irreducible cubic $f\in\mathbb Z[x]$ and a full norm form $\mathbf N(x_1,\ldots,x_k)$ for a number field $K/\mathbb Q$ satisfying certain hypotheses the variety $f(t)=\mathbf N(x_1,\ldots,x_k)\ne 0$ satisfies the Hasse…
We prove an algebraic canonicity theorem for normal LE-logics of arbitrary signature, in a generalized setting in which the non-lattice connectives are interpreted as operations mapping tuples of elements of the given lattice to closed or…
We show how lattice paths and the reflection principle can be used to give easy proofs of unimodality results. In particular, we give a "one-line" combinatorial proof of the unimodality of the binomial coefficients. Other examples include…
Assuming an integral quadratic polynomial with nonsingular quadratic part has a nontrivial zero on an integer lattice outside of a union of finite-index sublattices, we prove that there exists such a zero of bounded norm and provide an…
We prove a Hasse principle for solving equations of the form ax+by+cz=0 where x, y, z belong to a given finite index subgroup of the multiplicative group of rational numbers. From this we deduce a Hasse principle for diagonal curves over…
We derive formulas for characterizing bounded orthogonally additive polynomials in two ways. Firstly, we prove that certain formulas for orthogonally additive polynomials derived in \cite{Kusa} actually characterize them. Secondly, by…
This paper establishes some equivalent conditions of a uninorm, extending an arbitrary triangular norm on [0, e] or an arbitrary triangular conorm on [e, 1] to the whole lattice.
To each of the Johnson, Grassmann and Hamming graphs we associate a lattice and characterize the eigenspaces of the adjacency operator in terms of this lattice . We also show that each level of the lattice induces in a natural way a tight…
For a positive integer $s$, a lattice $L$ is said to be $s$-integrable if $\sqrt{s}\cdot L$ is isometric to a sublattice of $\mathbb{Z}^n$ for some integer $n$. Conway and Sloane found two minimal non $2$-integrable lattices of rank $12$…
We investigate the Hasse principles for isotropy and isometry of quadratic forms over finitely generated field extensions with respect to various sets of discrete valuations. Over purely transcendental field extensions of fields that…
The Hasse principle in number theory states that information about integral solutions to Diophantine equations can be pieced together from real solutions and solutions modulo prime powers. We show that the Hasse principle holds for…
Working on Berkovich analytic curves, we propose a geometric approach to the study of the Hasse principle over function fields of curves defined over a complete discretely valued field. Using it, we show the Hasse principle to be verified…
It is shown that the lattices of flats of boolean representable simplicial complexes are always atomistic, but semimodular if and only if the complex is a matroid. A canonical construction is introduced for arbitrary finite atomistic…
We establish the Hasse Principle for systems of r simultaneous diagonal cubic equations whenever the number of variables exceeds 6r and the associated coefficient matrix contains no singular r x r submatrix, thereby achieving the…
We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…
The visibility of lattice points from the origin along a polynomial family of curves constitutes a significant generalization of visibility along straight lines. Following the classical notion, where the density equals 1/2, and its…