Zobrazeno 1 - 10
of 56
pro vyhledávání: '"Stanojkovski, Mima"'
Autor:
Neri, Alessandro, Stanojkovski, Mima
Ferrers diagram rank-metric codes were introduced by Etzion and Silberstein in 2009. In their work, they proposed a conjecture on the largest dimension of a space of matrices over a finite field whose nonzero elements are supported on a given Ferrers
Externí odkaz:
http://arxiv.org/abs/2306.16407
Let $d$ be a positive integer. A finite group is called $d$-maximal if it can be generated by precisely $d$ elements, while its proper subgroups have smaller generating sets. For $d\in\{1,2\}$, the $d$-maximal groups have been classified up to isomor
Externí odkaz:
http://arxiv.org/abs/2305.16254
Autor:
Agathocleous, Eleni, Anupindi, Vishnupriya, Bachmayr, Annette, Martindale, Chloe, Nchiwo, Rahinatou Yuh Njah, Stanojkovski, Mima
In [15], Leonardi and Ruiz-Lopez propose an additively homomorphic public key encryption scheme whose security is expected to depend on the hardness of the learning homomorphism with noise problem (LHN). Choosing parameters for their primitive requir
Externí odkaz:
http://arxiv.org/abs/2302.12867
Autor:
Maglione, Joshua, Stanojkovski, Mima
A smooth cuboid can be identified with a $3\times 3$ matrix of linear forms, with coefficients in a field $K$, whose determinant describes a smooth cubic in the projective plane. To each such matrix one can associate a group scheme over $K$. We produ
Externí odkaz:
http://arxiv.org/abs/2212.03941
Let $p$ be a an odd prime and let $G$ be a finite $p$-group with cyclic commutator subgroup $G'$. We prove that the exponent and the abelianization of the centralizer of $G'$ in $G$ are determined by the group algebra of $G$ over any field of charact
Externí odkaz:
http://arxiv.org/abs/2209.06143
The linear spaces that are fixed by a given nilpotent $n \times n$ matrix form a subvariety of the Grassmannian. We classify these varieties for small $n$. Mutiah, Weekes and Yacobi conjectured that their radical ideals are generated by certain linea
Externí odkaz:
http://arxiv.org/abs/2207.00802
Autor:
Neri, Alessandro, Stanojkovski, Mima
Publikováno v:
In Journal of Combinatorial Theory, Series A November 2024 208
Autor:
Stanojkovski, Mima
Publikováno v:
Des. Codes Cryptogr. 91, 2449-2472 (2023)
We give a generalization of subspace codes by means of codes of modules over finite commutative chain rings. We define a new class of Sperner codes and use results from extremal combinatorics to prove the optimality of such codes in different cases.
Externí odkaz:
http://arxiv.org/abs/2202.13370
Bolytropes are bounded subsets of an affine building that consist of all points that have distance at most $r$ from some polytrope. We prove that the points of a bolytrope describe the set of all invariant lattices of a bolytrope order, generalizing
Externí odkaz:
http://arxiv.org/abs/2111.11244