Matrix-valued Cauchy bi-orthogonal polynomials are proposed in this paper, together with its quasideterminant expression. It is shown that the coefficients in the four-term recurrence relation for matrix-valued Cauchy bi-orthogonal polynomials satisfy a novel noncommutative integrable system, whose Lax pair is given by fractional differential operators with non-abelian variables.
Given two linear codes, the code equivalence problem asks to find an isometry mapping one code into the other. The problem can be described in terms of group actions and, as such, finds a natural application in signatures derived from a Zero-Knowledge Proof system. A recent paper, presented at Asiacrypt 2023, showed how a proof of equivalence can be significantly compressed by describing how the isometry acts only on an information set. Still, the resulting signatures are far from being optimal, as the size for a witness to this relation is still significantly larger than the theoretical lower bound, which is twice the security parameter. In this paper, we fill this gap and propose a new notion of equivalence, which leads to a drastically reduced witness size. For many cases, the resulting size is exactly the optimal one given by the lower bound. We achieve this by introducing the framework of canonical representatives, that is, representatives for classes of codes which are equivalent under some notion of equivalence. We propose new notions of equivalence which encompass and further extend all the existing ones: this allows to identify broader classes of equivalent codes, for which the equivalence can be proved with a very compact witness. We associate these new notions to a specific problem, called Canonical Form Linear Equivalence Problem (CF-LEP), which we show to be as hard as the original one (when random codes are considered), providing reductions in both ways. As an added consequence, this reduction leads to a new solver for the code equivalence problem, which is the fastest solver when the finite field size is large enough. Finally, we show that our framework yields a remarkable reduction in signature size when compared to the LESS submission. Our variant is able to obtain very compact signatures, around 2 KB or less, which are among the smallest in the code-based setting.
Exact solutions describing trapped modes in a plane quantum waveguide with a small rigid obstacle are constructed in the form of convergent series in powers of the small parameter characterizing the smallness of the obstacle. The terms of this series are expressed through the solution of the exterior Neumann problem for the Laplace equation describing the flow of unbounded fluid past the inflated obstacle. The exact solutions obtained describe discrete eigenvalues of the problem under certain geometric conditions, and, when the obstacle is symmetric, these solutions describe embedded eigenvalues. For obstacles symmetric with respect to the centerline of the waveguide, the existence of embedded trapped modes is known (due to the decomposition trick of the domain of the corresponding differential operator) even without the smallness assumption. We construct these solutions in an explicit form for small obstacles. For obstacles symmetric with respect to the vertical axis, we find embedded trapped modes for a specific vertical displacement of the obstacle.
We prove that, for any (B subset {mathbb {R}}), the Cartesian product set (B times B) determines (Omega (|B|^{2+c})) distinct angles.
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：