相关论文: Minimal Logarithmic Signatures for Sporadic Groups

In this paper, we address the problem of achieving efficient code-based digital signatures with small public keys. The solution we propose exploits sparse syndromes and randomly designed low-density generator matrix codes. Based on our…

In this article, the goal is to find the shortest presentation of a matrix $A \in PSL(2,\mathbb{Z})$ in terms of the so-called continuant matrices which are most known for their role in continued fraction theory. In chapter 7 of…

We propose an efficient algorithm for approximate computation of the profile maximum likelihood (PML), a variant of maximum likelihood maximizing the probability of observing a sufficient statistic rather than the empirical sample. The PML…

Count-Min Sketch (CMS) is a memory-efficient data structure for estimating the frequency of elements in a multiset. Learned Count-Min Sketch (LCMS) enhances CMS with a machine learning model to reduce estimation error under the same memory…

Since their introduction in 2004, Polynomial Modular Number Systems (PMNS) have become a very interesting tool for implementing cryptosystems relying on modular arithmetic in a secure and efficient way. However, while their implementation…

We propose a new system identification method, called Sign-Perturbed Sums (SPS), for constructing non-asymptotic confidence regions under mild statistical assumptions. SPS is introduced for linear regression models, including but not…

This article presents a 3-local characterisation of the sporadic simple group McL and its automorphism group. The theorem is underpinned by a further identification theorem the proof of which is character theoretic. The main theorem is…

Partial spread is important in finite geometry and can be used to construct linear codes. From the results in (Designs, Codes and Cryptography 90:1-15, 2022) by Xia Li, Qin Yue and Deng Tang, we know that if the number of the elements in a…

We show that real semi-simple Lie groups of higher rank contain (infinitely generated) discrete subgroups with full limit sets in the corresponding Furstenberg boundaries. Additionally, we provide criteria under which discrete subgroups of…

We classify the locally compact second-countable (l.c.s.c.) groups $A$ that are abelian and topologically characteristically simple. All such groups $A$ occur as the monolith of some soluble l.c.s.c. group $G$ of derived length at most $3$;…

Let $G$ be a finite non-cyclic, non-characteristically simple group with the property that all proper characteristic subgroups of $G$ are cyclic. We call such a group $\mathrm{CCS}$ group, short for \emph{Characteristic Cyclic}. In this…

We construct good GKP (Gottesman-Kitaev-Preskill) codes (in the sense of Conrad, Eisert and Seifert proposed) from standard short integer solution lattices (SIS) as well as from ring SIS and module SIS lattices, R-SIS and M-SIS lattices,…

In this paper, we study the form over the minimum spanning tree problem (MST) from which we will derive an intuitively generalized model and new methods with the upper bound of runtimes of logarithm. The new pattern we made has taken…

We prove that the length of the shortest identity in a finite simple group of Lie type of rank $r$ defined over $\mathbb{F}_q$, is bounded (from above and below) by explicit polynomials in $q$ and $r$.

Code explanation plays a crucial role in the software engineering domain, aiding developers in grasping code functionality efficiently. Recent work shows that the performance of LLMs for code explanation improves in a few-shot setting,…

We define a family of random sets of points, the Diamond ensemble, on the sphere $\mathbb{S}^{2}$ depending on several parameters. Its most important property is that, for some of these parameters, the asymptotic expected value of the…

Theory evaluation is a key problem in many areas: machine learning, scientific discovery, inverse engineering, decision making, software engineering, design, human sciences, etc. If we have a set of theories that are able to explain the…

In a finite group $ G $, $ \psi(G) $ denotes the sum of element orders of $ G $. A finite group $ G $ is said to be a $\mathscr{B}_{\psi}$-group if $ \psi(H) < |G| $ for any proper subgroup $ H $ of $ G $. In \cite{Lazorec} Lazorec asked:…

As one of the recently proposed algorithms for sparse system identification, $l_0$ norm constraint Least Mean Square ($l_0$-LMS) algorithm modifies the cost function of the traditional method with a penalty of tap-weight sparsity. The…

A set $S$ of vertices of a graph is a defensive alliance if, for each element of $S$, the majority of its neighbours is in $S$. We consider the notion of local minimality in this paper. We are interested in locally minimal defensive…