Related papers: Aperiodic logarithmic signatures

We consider the orthogonalisation of the signature of a stochastic process as the analogue of orthogonal polynomials on path-space. Under an infinite radius of convergence assumption, we prove density of linear functions on the signature in…

Algebraic injectivity was introduced to capture homotopical structures like algebraic Kan complexes. But at a much simpler level, it allows one to describe sets with operations subject to no equations. If one wishes to add equations (or…

For numerical semigroups with three generators, we study the asymptotic behavior of weighted factorization lengths, that is, linear functionals of the coefficients in the factorizations of semigroup elements. This work generalizes many…

We consider algebras with basis numerated by elements of a group $G.$ We fix a function $f$ from $G\times G$ to a ground field and give a multiplication of the algebra which depends on $f$. We study the basic properties of such algebras. In…

We consider some well-behaved cases of the gluing formalism for punctured stable log maps of Abramovich-Chen-Gross-Siebert. This gives a gluing formula for log Gromov-Witten invariants in a diverse set of cases; in particular, the gluing…

In Part I of this article we generalize the Linearized Doubling (LD) approach, introduced in earlier work by NK, by proving a general theorem stating that if $\Sigma$ is a closed minimal surface embedded in a Riemannian three-manifold…

We look at constructions of aperiodic SFTs on fundamental groups of graph of groups. In particular we prove that all generalized Baumslag-Solitar groups (GBS) admit a strongly aperiodic SFT. Our proof is based on a structural theorem by…

Text clustering is arguably one of the most important topics in modern data mining. Nevertheless, text data require tokenization which usually yields a very large and highly sparse term-document matrix, which is usually difficult to process…

Stern's signature scheme is a historically important code-based signature scheme. A crucial optimization of this scheme is to generate pseudo-random vectors and a permutation instead of random ones, and most proposals that are based on…

In this paper we develop techniques that eliminate the need of the Generalized Riemann Hypothesis (GRH) from various (almost all) known results about deterministic polynomial factoring over finite fields. Our main result shows that given a…

We propose a novel digital signature cryptosystem that exploits the concept of the brute-force problem. To ensure the security of the cryptosystem, we employed several mechanisms: sharing a common secret for factorable permutations,…

We generalize signature Gr\"obner bases, previously studied in the free algebra over a field or polynomial rings over a ring, to ideals in the mixed algebra $R[x_1,...,x_k]\langle y_1,\dots,y_n \rangle$ where $R$ is a principal ideal…

The general principle for a quantum signature scheme is proposed and investigated based on ideas from classical signature schemes and quantum cryptography. The suggested algorithm is implemented by a symmetrical quantum key cryptosystem and…

The objective of this work is to survey several digital signatures proposed in the last decade using non-commutative groups and rings and propose a digital signature using non-commutative groups and analyze its security.

In this paper, we reveal an intriguing relationship between two seemingly unrelated notions: letter graphs and geometric grid classes of permutations. An important property common for both of them is well-quasi-orderability, implying, in a…

The purpose of this note is to present a method for classifying three-dimensional polyhedra in terms of their symmetry groups. This method is constructive and it is described in terms of the conjugation classes of crystallographic groups in…

Introduced by Tate in [Ta71], Tate algebras play a major role in the context of analytic geometry over the-adics, where they act as a counterpart to the use of polynomial algebras in classical algebraic geometry. In [CVV19] the formalism of…

It is an oft-cited fact that no quantum code can support a set of fault-tolerant logical gates that is both universal and transversal. This no-go theorem is generally responsible for the interest in alternative universality constructions…

Twenty years after the discovery of the F5 algorithm, Gr\"obner bases with signatures are still challenging to understand and to adapt to different settings. This contrasts with Buchberger's algorithm, which we can bend in many directions…

In the last decade, the concept of path signature has achieved significant success in data science applications. It offers a powerful set of features that effectively capture and describe the characteristics of paths or sequential data.…