Related papers: On Using Expansions to the Base of -2
In this article, we consider some generalizations of polynomial and exponential B-splines. Firstly, the extension from integral to complex orders is reviewed and presented. The second generalization involves the construction of uncountable…
Expander graphs are widely used in communication problems and construction of error correcting codes. In such graphs, information gets through very quickly. Typically, it is not true for social or biological networks, though we may find a…
The study of alternative models for elliptic curves has found recent interest from cryptographic applications, once it was recognized that such models provide more efficiently computable algorithms for the group law than the standard…
We derive two conditional expectation bounds, which we use to simplify cryptographic security proofs. The first bound relates the expectation of a bounded random variable and the average of its conditional expectations with respect to a set…
The stable pairs theory of local curves in 3-folds (equivariant with respect to the scaling 2-torus) is studied with stationary descendent insertions. Reduction rules are found to lower descendents when higher than the degree. Factorization…
NOTE: PAPER WITHDRAWN (See Comments) The Clifford and Local Clifford groups for $d > 2$ dimensional systems have been topics of recent interest due to their applications in graph states, quantum codes, and possible applications in fast…
The theory of finite simple groups is a (rather unexplored) area likely to provide interesting computational problems and modelling tools useful in a cryptographic context. In this note, we review some applications of finite non-abelian…
We give practical algorithms for computing the divisor class group and the gonality of a curve over a finite field, achieving several orders of magnitude speedup over existing methods for sufficiently large genus or residue field. The…
A general specialization map is constructed for higher Chow groups and used to prove a "going-up" theorem for algebraic cycles and their regulators. The results are applied to study the degeneration of the modified diagonal cycle of Gross…
The study of the relation between Lie algebras and groups, and especially the derivation of new algebras from them, is a problem of great interest in mathematics and physics, because finding a new Lie group from an already known one also…
Modular polynomials are an important tool in many algorithms involving elliptic curves. In this article we investigate their generalization to the genus 2 case following pioneering work by Gaudry and Dupont. We prove various properties of…
The main practical limitation of the McEliece public-key encryption scheme is probably the size of its key. A famous trend to overcome this issue is to focus on subclasses of alternant/Goppa codes with a non trivial automorphism group. Such…
Multi-scalar multiplication (MSM) is crucial in cryptographic applications and computationally intensive in zero-knowledge proofs. MSM involves accumulating the products of scalars and points on an elliptic curve over a 377-bit modulus, and…
Diffusing a graph signal at multiple scales requires computing the action of the exponential of several multiples of the Laplacian matrix. We tighten a bound on the approximation error of truncated Chebyshev polynomial approximations of the…
Motivated by Xing's method [7], we show that there exist [n,k,d] linear Hermitian codes over F_{q^2} with k+d>=n-3 for all sufficiently large q. This improves the asymptotic bound of Algebraic-Geometry codes from Hermitian curves given in…
We consider the restriction of twice differentiable functionals on a Hilbert space to families of subspaces that vary continuously with respect to the gap metric. We study bifurcation of branches of critical points along these families, and…
We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or…
In this paper we discuss a natural extension of infinite discrete partition-of-unity copulas which were recently introduced in the literature to continuous partition of copulas with possible applications in risk management and other fields.…
In this article we present an algorithm to compute bounds on the marginals of a graphical model. For several small clusters of nodes upper and lower bounds on the marginal values are computed independently of the rest of the network. The…
This paper computes the bases of the image of $2$-adic logarithm on the group of the principal units in all 7 quadratic extensions of $\mathbb{Q}_2$. This helps one to understand the free module structure of $2$-adic logarithm at arbitrary…