Searcharxiv⌕ Search

arXiv subjects

Mima Stanojkovski

Publications and source records attributed to Mima Stanojkovski.

At least 19 recordsLinked to original sources
arXiv2025

Independence and strong independence complexes of finite groups

Let $G$ be a finite group. In 2024, Cameron introduced two different concepts of independence (namely independence and strong independence) for the subsets of $G$, yielding to the definition of two simplicial complexes whose vertices are the elements of $G$. The strong independence complex $\tilde\Sigma(G)$ turns out to be a subcomplex of the independence complex $\Sigma(G)$. We discuss several invariant properties related to these complexes and ask a number of questions inspired by our results and the examples we construct. We study then the particular case of complexes on finite abelian groups, giving a characterization of the finite groups realizing them. In conclusion, answering a question of Cameron, we classify all finite groups in which the two concepts of independence coincide.

math.GR↗
arXiv2023

Valued rank-metric codes

In this paper, we study linear spaces of matrices defined over discretely valued fields and discuss their dimension and minimal rank drops over the associated residue fields. To this end, we take first steps into the theory of rank-metric codes over discrete valuation rings by means of skew algebras derived from Galois extensions of rings. Additionally, we model projectivizations of rank-metric codes via Mustafin varieties, which we then employ to give sufficient conditions for a decrease in the dimension.

math.NT↗
arXiv2023

On homomorphic encryption using abelian groups: Classical security analysis

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 requires choosing three groups $G$, $H$, and $K$. In their paper, Leonardi and Ruiz-Lopez claim that, when $G$, $H$, and $K$ are abelian, then their public key cryptosystem is not quantum secure. In this paper, we study security for finite abelian groups $G$, $H$, and $K$ in the classical case. Moreover, we study quantum attacks on instantiations with solvable groups.

cs.CR↗
arXiv2023

A proof of the Etzion-Silberstein conjecture for monotone and MDS-constructible Ferrers diagrams

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 diagram and all have rank lower bounded by a fixed positive integer $d$. Since stated, the Etzion-Silberstein conjecture has been verified in a number of cases, often requiring additional constraints on the field size or on the minimum rank $d$ in dependence of the corresponding Ferrers diagram. As of today, this conjecture still remains widely open. Using modular methods, we give a constructive proof of the Etzion-Silberstein conjecture for the class of strictly monotone Ferrers diagrams, which does not depend on the minimum rank $d$ and holds over every finite field. In addition, we leverage on the last result to also prove the conjecture for the class of MDS-constructible Ferrers diagrams, without requiring any restriction on the field size.

math.CO↗
arXiv2023

On finite $d$-maximal groups

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 isomorphism and only partial results have been proven for larger $d$. In this work, we prove that a $d$-maximal group is supersolvable and we give a characterization of $d$-maximality in terms of so-called maximal $(p,q)$-pairs. Moreover, we classify the maximal $(p,q)$-pairs of small rank obtaining, as a consequence, a full classification of the isomorphism classes of $3$-maximal finite groups.

math.GR↗
arXiv2023

Subspaces Fixed by a Nilpotent Matrix

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 linear forms known as shuffle equations. We prove this conjecture for $n \leq 7$, and we disprove it for $n=8$. The question remains open for nilpotent matrices arising from the affine Grassmannian.

math.RA↗
arXiv2023

Submodule codes as spherical codes in buildings

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. Moreover, we explain the connection with Bruhat-Tits buildings and show how our codes are the buildings' analogue of spherical codes in the Euclidean sense.

cs.IT↗
arXiv2023

Orbits classifying extensions of prime power order groups

The strong isomorphism classes of extensions of finite groups are parametrized by orbits of a prescribed action on the second cohomology group. We study these orbits in the case of extensions of a finite abelian $p$-group by a cyclic factor of order $p$. As an application, we compute number and sizes of these orbits when the initial $p$-group is generated by at most $3$ elements.

math.GR↗
arXiv2022

Smooth cuboids in group theory

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 produce isomorphism invariants of these groups in terms of their adjoint algebras, which also give information on the number of their maximal abelian subgroups. Moreover, we give a characterization of the isomorphism types of the groups in terms of isomorphisms of elliptic curves and also give a description of the automorphism group. We conclude by applying our results to the determination of the automorphism groups and isomorphism testing of finite $p$-groups of class $2$ and exponent $p$ arising in this way.

math.GR↗
arXiv2022

On group invariants determined by modular group algebras: even versus odd characteristic

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 characteristic $p$. If, additionally, $G$ is $2$-generated then almost all the numerical invariants determining $G$ up to isomorphism are determined by the same group algebras; as a consequence the isomorphism type of the centralizer of $G'$ is determined. These claims are known to be false for $p=2$.

math.GR↗
arXiv2022

Bolytrope orders

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 the correspondence between polytropes and graduated orders.

math.RA↗
arXiv2021

Toric varieties from cyclic matrix semigroups

We present and expand some existing results on the Zariski closure of cyclic groups and semigroups of matrices. We show that, with the exclusion of isolated points, their irreducible components are toric varieties. Additionally, we demonstrate how every toric variety can be realized as the Zariski closure of a cyclic matrix group. Our paper includes a number of explicit examples and a note on existing computational results.

math.AG↗
arXiv2021

Orders and Polytropes: Matrix Algebras from Valuations

We apply tropical geometry to study matrix algebras over a field with valuation. Using the shapes of min-max convexity, known as polytropes, we revisit the graduated orders introduced by Plesken and Zassenhaus. These are classified by the polytrope region. We advance the ideal theory of graduated orders by introducing their ideal class polytropes. This article emphasizes examples and computations. It offers first steps in the geometric combinatorics of endomorphism rings of configurations in affine buildings.

math.CO↗
arXiv2021

Cryptographic multilinear maps using pro-p groups

To any nilpotent group of class n, one can associate a non-interactive key exchange protocol between n+1 users. The multilinear commutator maps associated to nilpotent groups play a key role in this protocol. In the present paper, we discuss the security of this key exchange when applied to finite p-groups and explore some alternative platforms, such as pro-p groups.

cs.CR↗
arXiv2021

Hessian matrices, automorphisms of $p$-groups, and torsion points of elliptic curves

We describe the automorphism groups of finite $p$-groups arising naturally via Hessian determinantal representations of elliptic curves defined over number fields. Moreover, we derive explicit formulas for the orders of these automorphism groups for elliptic curves of $j$-invariant $1728$ given in Weierstrass form. We interpret these orders in terms of the numbers of $3$-torsion points (or flex points) of the relevant curves over finite fields. Our work greatly generalizes and conceptualizes previous examples given by du Sautoy and Vaughan-Lee. It explains, in particular, why the orders arising in these examples are polynomial on Frobenius sets and vary with the primes in a nonquasipolynomial manner.

math.GR↗
arXiv2018

Evolving groups

The class of evolving groups is defined and investigated, as well as their connections to examples in the field of Galois cohomology. Evolving groups are proved to be Sylow Tower groups in a rather strong sense. In addition, evolving groups are characterized as semidirect products of two nilpotent groups of coprime orders where the action of one on the other is via automorphisms that map each subgroup to a conjugate.

math.GR↗