arXiv subjects
Publications and source records attributed to J. Rosenthal.
In this paper we prove that rank metric codes with special properties imply the existence of $q$-analogs of suitable designs. More precisely, we show that the minimum weight vectors of a $[2d,d,d]$ dually almost MRD code $C\leq \mathbb{F}_{q^m}^n$ which has no code words of rank weight $d+1$ form a $q$-analog Steiner system $S_q(d-1,d,2d)$. In particular, $d+1$ must be a prime.
In this paper, we compute the natural density of the set of k x n integer matrices that can be extended to an invertible n x n matrix over the integers. As a corollary, we find the density of rectangular matrices with Hermite normal form [O Id]. Connections with Cesaro's Theorem on the density of coprime integers and Quillen-Suslin's Theorem are also presented.
A generalization of the original Diffie-Hellman key exchange in $(\Z/p\Z)^*$ found a new depth when Miller and Koblitz suggested that such a protocol could be used with the group over an elliptic curve. In this paper, we propose a further vast generalization where abelian semigroups act on finite sets. We define a Diffie-Hellman key exchange in this setting and we illustrate how to build interesting semigroup actions using finite (simple) semirings. The practicality of the proposed extensions rely on the orbit sizes of the semigroup actions and at this point it is an open question how to compute the sizes of these orbits in general and also if there exists a square root attack in general. In Section 2 a concrete practical semigroup action built from simple semirings is presented. It will require further research to analyse this system.
The paper analyzes a new public key cryptosystem whose security is based on a matrix version of the discrete logarithm problem over an elliptic curve. It is shown that the complexity of solving the underlying problem for the proposed system is dominated by the complexity of solving a fixed number of discrete logarithm problems in the group of an elliptic curve. Using an adapted Pollard rho algorithm it is shown that this problem is essentially as hard as solving one discrete logarithm problem in the group of an elliptic curve.
Maximum distance profile codes are characterized by the property that two trajectories which start at the same state and proceed to a different state will have the maximum possible distance from each other relative to any other convolutional code of the same rate and degree. In this paper we use methods from systems theory to characterize maximum distance profile codes algebraically. Tha main result shows that maximum distance profile codes form a generic set inside the variety which parametrizes the set of convolutional codes of a fixed rate and a fixed degree.
We obtain an explicit determinantal formula for the multiplicity of any point on a classical Schubert variety.
We compute the degree of the generalized Plücker embedding $κ$ of a Quot scheme $X$ over $\PP^1$. The space $X$ can also be considered as a compactification of the space of algebraic maps of a fixed degree from $\PP^1$ to the Grassmanian $\rm{Grass}(m,n)$. Then the degree of the embedded variety $κ(X)$ can be interpreted as an intersection product of pullbacks of cohomology classes from $\rm{Grass}(m,n)$ through the map $ψ$ that evaluates a map from $\PP^1$ at a point $x\in \PP^1$. We show that our formula for the degree verifies the formula for these intersection products predicted by physicists through Quantum cohomology~\cite{va92}~\cite{in91}~\cite{wi94}. We arrive at the degree by proving a version of the classical Pieri's formula on the variety $X$, using a cell decomposition of a space that lies in between $X$ and $κ(X)$.