Related papers: On A Cryptographic Identity In Osborn Loops
We study cluster algebras for some all-loop Feynman integrals, including box-ladder, penta-box-ladder, and (seven-point) double-penta-ladder integrals. In addition to the well-known box ladder whose symbol alphabet is $D_2\simeq A_1^2$, we…
Recently N.Jing discovered a certain combinatorial identity from validity of the Serre relations in some vertex representations of quantum Kac-Moody algebras. We generalize this identity, in particular, extending it from polynomials to…
Motivated by a polynomial identity of certain iterated integrals, first observed in [CGM20] in the setting of lattice paths, we prove an intriguing combinatorial identity in the shuffle algebra. It has a close connection to de Bruijn's…
We introduce a hitherto unexplored form of quantum nonlocality, termed local subset unidentifiability, that arises from the limitation of spatially separated parties to perfectly identify a subset of mutually orthogonal multipartite quantum…
Given a Lie algebra \s, we call Lie \s-algebra a Lie algebra endowed with a reductive action of \s. We characterize the minimal \s-Lie algebras with a nontrivial action of \s, in terms of irreducible representations of \s and invariant…
LDP (Local Differential Privacy) has recently attracted much attention as a metric of data privacy that prevents the inference of personal data from obfuscated data in the local model. However, there are scenarios in which the adversary…
We construct and prove a diagrammatic version of the Duflo isomorphism between the invariant subalgebra of the symmetric algebra of a Lie algebra and the center of the universal enveloping algebra. This version implies the original for…
We define a variety of loops called semiautomorphic, inverse property loops that generalize Moufang and Steiner loops. We first show an equivalence between a previously studied variety of loops. Next we extend several known results for…
We utilise characteristic identities to construct eigenvalue formulae for invariants and reduced matrix elements corresponding to irreducible representations of osp(m|n). In presenting these results, we further develop our programme of…
We introduce the notion of isolated genus two curves. As there is no known efficient algorithm to explicitly construct isogenies between two genus two curves with large conductor gap, the discrete log problem (DLP) cannot be efficiently…
A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be…
Person re-identification is a popular research topic which aims at matching the specific person in a multi-camera network automatically. Feature representation and metric learning are two important issues for person re-identification. In…
System-on-Chips (SoCs) form the crux of modern computing systems. SoCs enable high-level integration through the utilization of multiple Intellectual Property (IP) cores. However, the integration of multiple IP cores also presents unique…
Square Wave Perceptrons (SWPs) form a class of neural network models with oscillating activation function that exhibit intriguing ``hardness'' properties in the high-dimensional limit at a fixed constraint density $\alpha = O(1)$. In this…
A number of examples of Hamiltonian systems that are integrable by classical means are cast within the framework of isospectral flows in loop algebras. These include: the Neumann oscillator, the cubically nonlinear Schr\"odinger systems and…
Graph isomorphism, a classical algorithmic problem, determines whether two input graphs are structurally identical or not. Interestingly, it is one of the few problems that is not yet known to belong to either the P or NP-complete…
The Lifting Idempotent Property ($LIP$) of ideals in commutative rings inspired the study of Boolean lifting properties in the context of other concrete algebraic structures ($MV$-algebras, commutative l-groups, $BL$-algebras, bounded…
Counting small cohesive subgraphs in a graph is a fundamental operation with numerous applications in graph analysis. Previous studies on cohesive subgraph counting are mainly based on the clique model, which aim to count the number of…
An important open problem in supersingular isogeny-based cryptography is to produce, without a trusted authority, concrete examples of "hard supersingular curves" that is, equations for supersingular curves for which computing the…
Iterative clustering algorithms help us to learn the insights behind the data. Unfortunately, this may allow adversaries to infer the privacy of individuals with some background knowledge. In the worst case, the adversaries know the…