Cyclic Lattices, Ideal Lattices and Bounds for the Smoothing Parameter

<div>Cyclic lattices and ideal lattices were introduced by Micciancio in \cite{D2}, Lyubashevsky and Micciancio in \cite{L1} respectively, which play an efficient role in Ajtai's construction of a collision resistant Hash function (see \cite{M1} and \cite{M2}) and in Gentry's construction of fully homomorphic encryption (see \cite{G}). Let $R=Z[x]/\langle \phi(x)\rangle$ be a quotient ring of the integer coefficients polynomials ring, Lyubashevsky and Micciancio regarded an ideal lattice as the correspondence of an ideal of $R$, but they neither explain how to extend this definition to whole Euclidean space $\mathbb{R}^n$, nor exhibit the relationship of cyclic lattices and ideal lattices.</div><div>In this paper, we regard the cyclic lattices and ideal lattices as the correspondences of finitely generated $R$-modules, so that we may show that ideal lattices are actually a special subclass of cyclic lattices, namely, cyclic integer lattices. In fact, there is a one to one correspondence between cyclic lattices in $\mathbb{R}^n$ and finitely generated $R$-modules (see Theorem \ref{th4} below). On the other hand, since $R$ is a Noether ring, each ideal of $R$ is a finitely generated $R$-module, so it is natural and reasonable to regard ideal lattices as a special subclass of cyclic lattices (see corollary \ref{co3.4} below). It is worth noting that we use more general rotation matrix here, so our definition and results on cyclic lattices and ideal lattices are more general forms. As application, we provide cyclic lattice with an explicit and countable upper bound for the smoothing parameter (see Theorem \ref{th5} below). It is an open problem that is the shortest vector problem on cyclic lattice NP-hard? (see \cite{D2}). Our results may be viewed as a substantial progress in this direction.</div>

Cyclic Lattices, Ideal Lattices and Bounds for the Smoothing Parameter

<div>Cyclic lattices and ideal lattices were introduced by Micciancio in \cite{D2}, Lyubashevsky and Micciancio in \cite{L1} respectively, which play an efficient role in Ajtai's construction of a collision resistant Hash function (see \cite{M1} and \cite{M2}) and in Gentry's construction of fully homomorphic encryption (see \cite{G}). Let $R=Z[x]/\langle \phi(x)\rangle$ be a quotient ring of the integer coefficients polynomials ring, Lyubashevsky and Micciancio regarded an ideal lattice as the correspondence of an ideal of $R$, but they neither explain how to extend this definition to whole Euclidean space $\mathbb{R}^n$, nor exhibit the relationship of cyclic lattices and ideal lattices.</div><div>In this paper, we regard the cyclic lattices and ideal lattices as the correspondences of finitely generated $R$-modules, so that we may show that ideal lattices are actually a special subclass of cyclic lattices, namely, cyclic integer lattices. In fact, there is a one to one correspondence between cyclic lattices in $\mathbb{R}^n$ and finitely generated $R$-modules (see Theorem \ref{th4} below). On the other hand, since $R$ is a Noether ring, each ideal of $R$ is a finitely generated $R$-module, so it is natural and reasonable to regard ideal lattices as a special subclass of cyclic lattices (see corollary \ref{co3.4} below). It is worth noting that we use more general rotation matrix here, so our definition and results on cyclic lattices and ideal lattices are more general forms. As application, we provide cyclic lattice with an explicit and countable upper bound for the smoothing parameter (see Theorem \ref{th5} below). It is an open problem that is the shortest vector problem on cyclic lattice NP-hard? (see \cite{D2}). Our results may be viewed as a substantial progress in this direction.</div>

The probability certain random quadratics have real roots

Early in high school algebra, quadratics chosen as examples by teachers and textbooks alike tend to have integer coefficients and to factorise over the integers. This can give the misleading impression that such quadratics are the norm. As students progress into calculus and begin regularly seeing quadratics that are not as ‘nice’, we hope they become disabused of this notion. Indeed, even if the coefficients of the quadratic are integers, the probability that the quadratic factorises over the integers tends to zero as the range from which the integers are drawn grows (see [1]). But what if we ask about a behaviour less restrictive than factorising, say merely having real roots? This is the problem that concerns this Article.

On Polynomial Solutions of Pell’s Equation

Polynomial Pell’s equation is x 2 − D y 2 = ± 1 , where D is a quadratic polynomial with integer coefficients and the solutions X , Y must be quadratic polynomials with integer coefficients. Let D = a 2 x 2 + a 1 x + a 0 be a polynomial in Z x . In this paper, some quadratic polynomial solutions are given for the equation x 2 − D y 2 = ± 1 which are significant from computational point of view.

Matrix-Based RSA Encryption of Streaming Data

This paper describes a new method for performing secure encryption of blocks of streaming data. This algorithm is an extension of the RSA encryption algorithm. Instead of using a public key (e,n) where n is the product of two large primes and e is relatively prime to the Euler Totient function, φ(n), one uses a public key (n,m,E), where m is the rank of the matrix E and E is an invertible matrix in GL(m,φ(n)). When m is 1, this last condition is equivalent to saying that E is relatively prime to φ(n), which is a requirement for standard RSA encryption. Rather than a secret private key (d,φ(n)) where d is the inverse of e (mod φ(n)), the private key is (D,φ(n)), where D is the inverse of E (mod (φ(n)). The key to making this generalization work is a matrix generalization of the scalar exponentiation operator that maps the set of m-dimensional vectors with integer coefficients modulo n, onto itself.

Strong positivity for quantum theta bases of quantum cluster algebras

We construct “quantum theta bases,” extending the set of quantum cluster monomials, for various versions of skew-symmetric quantum cluster algebras. These bases consist precisely of the indecomposable universally positive elements of the algebras they generate, and the structure constants for their multiplication are Laurent polynomials in the quantum parameter with non-negative integer coefficients, proving the quantum strong cluster positivity conjecture for these algebras. The classical limits recover the theta bases considered by Gross–Hacking–Keel–Kontsevich (J Am Math Soc 31(2):497–608, 2018). Our approach combines the scattering diagram techniques used in loc. cit. with the Donaldson–Thomas theory of quivers.

About the number of τ-numbers relative to polynomials with integer coefficients

We show that for all polynomials Q(x) with integer coefficients, that satisfy the extra condition |Q(0) · Q(1) | ≠ 1, there are infinitely many positive integers n such that n is a τ-number relative to the polynomial Q(x). We also find some examples of polynomials Q(x) for which 1 is the only τ-number relative to the polynomial Q(x) and some examples of polynomials Q(x) with |Q(0) · Q(1)|= 1, which have infinitely many positive integers n such that n is a τ-number relative to the polynomial Q(x). In addition, we prove one result about the generators of a τ-number.

A short note on inadmissible coefficients of weight 2 and $$2k+1$$ newforms

Let $$f(z)=q+\sum _{n\ge 2}a(n)q^n$$ f ( z ) = q + ∑ n ≥ 2 a ( n ) q n be a weight k normalized newform with integer coefficients and trivial residual mod 2 Galois representation. We extend the results of Amir and Hong in Amir and Hong (On L-functions of modular elliptic curves and certain K3 surfaces, Ramanujan J, 2021) for $$k=2$$ k = 2 by ruling out or locating all odd prime values $$|\ell |<100$$ | ℓ | < 100 of their Fourier coefficients a(n) when n satisfies some congruences. We also study the case of odd weights $$k\ge 1$$ k ≥ 1 newforms where the nebentypus is given by a quadratic Dirichlet character.

The Resurgent Structure of Quantum Knot Invariants

The asymptotic expansion of quantum knot invariants in complex Chern–Simons theory gives rise to factorially divergent formal power series. We conjecture that these series are resurgent functions whose Stokes automorphism is given by a pair of matrices of q-series with integer coefficients, which are determined explicitly by the fundamental solutions of a pair of linear q-difference equations. We further conjecture that for a hyperbolic knot, a distinguished entry of those matrices equals to the Dimofte–Gaiotto–Gukov 3D-index, and thus is given by a counting of BPS states. We illustrate our conjectures explicitly by matching theoretically and numerically computed integers for the cases of the $$4_1$$ 4 1 and the $$5_2$$ 5 2 knots.

Homology and K-theory of dynamical systems I. Torsion-free ample groupoids

Given an ample groupoid, we construct a spectral sequence with groupoid homology with integer coefficients on the second sheet, converging to the K-groups of the (reduced) groupoid C $^*$ -algebra, provided the groupoid has torsion-free stabilizers and satisfies a strong form of the Baum–Connes conjecture. The construction is based on the triangulated category approach to the Baum–Connes conjecture developed by Meyer and Nest. We also present a few applications to topological dynamics and discuss the HK conjecture of Matui.