Skew-orthogonal polynomials (SOPs) arise in the study of the <i>n</i>-point distribution function for orthogonal and symplectic random matrix ensembles. Motivated by the average of characteristic polynomials of the Bures random matrix ensemble studied in Forrester and Kieburg (Commun Math Phys 342(1):151187, 2016), we propose the concept of <i>partial-skew-orthogonal polynomials</i> (PSOPs) as a modification of the SOPs, and then the PSOPs with a variety of special skew-symmetric kernels and weight functions are addressed. By considering appropriate deformations of the weight functions, we derive nine integrable lattices in different dimensions. As a consequence, the tau-functions for these systems are shown to be expressed in terms of Pfaffians and the wave vectors PSOPs. In fact, the tau-functions also admit the multiple integral representations. Among these integrable lattices, some of them are

No abstract uploaded!

Let G=(V,E) be a finite weighted graph, and Ω⊆V be a domain such that Ω^∘≠∅. In this paper, we study the following initial boundary problem for the non-homogenous wave equation ∂^2_t u(t,x) − Δ_Ω u(t,x) = f(t,x), (t,x)∈[0,∞)×Ω^∘ u(0,x)=g(x), x∈Ω^∘, ∂_t u(0,x)=h(x), x∈Ω^∘, u(t,x)=0, (t,x)∈[0,∞)×∂Ω, where Δ_Ω denotes the Dirichlet Laplacian on Ω^∘. Using Rothe's method, we prove that the above wave equation has a unique solution.

In this paper, we attack the recent NIST submission Giophantus, a public key encryption scheme. We find that the complicated structure of Giophantus's ciphertexts leaks information via a correspondence from a low dimensional lattice. This allows us to distinguish encrypted data from random data by the LLL algorithm. This is a more efficient attack than previous proposed attacks.

No abstract uploaded!