Aleksander Malnič

Aleksander Malnič

Auto-generated profile, based on publicly available information

Aleksander Malnič

University of Ljubljana

Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 2000 in European Journal of Combinatorics
Verified
Journal Article
Closed access
AMAleksander Malnič
Aleksander Malnič
RNRoman Nedela
Roman Nedela
MŠMartin Škoviera
Martin Škoviera

1 July 2004 in Journal of Algebraic Combinatorics
Verified
Journal Article
Open access
PDF file
AMAleksander Malnič
Aleksander Malnič
DMDragan Marusic
Dragan Marusic
PPPrimož Potočnik
Primož Potočnik
Let ${\mathcal{C}}$ G (X) be the set of all (equivalence classes of) regular covering projections of a given connected graph X along which a given group G ≤ Aut X of automorphisms lifts. There is a natural lattice structure on ${\mathcal{C}}$ G (X), where ℘1 ≤ ℘2 whenever ℘2 factors through ℘1. The sublattice ${\mathcal{C}}$ G (℘) of coverings which are below a given covering ℘ : X~ → X naturally corresponds to a lattice ${\mathcal{N}}$ G (℘) of certain subgroups of the group of covering transformations. In order to study this correspondence, some general theorems regarding morphisms and decomposition of regular covering projections are proved. All theorems are stated and proved combinatorially in terms of voltage assignments, in order to facilitate computation in concrete applications. For a given prime p, let ${\mathcal{C}}$ G p (X) ≤ ${\mathcal{C}}$ G (X) denote the sublattice of all regular covering projections with an elementary abelian p-group of covering transformations. There is an algorithm which explicitly constructs ${\mathcal{C}}$ G p (X) in the sense that, for each member of ${\mathcal{C}}$ G p (X), a concrete voltage assignment on X which determines this covering up to equivalence, is generated. The algorithm uses the well known algebraic tools for finding invariant subspaces of a given linear representation of a group. To illustrate the method two nontrival examples are included.

1 May 2006 in Journal of Algebraic Combinatorics
Verified
Journal Article
Closed access
PDF file
MCMarston Conder
Marston Conder
AMAleksander Malnič
Aleksander Malnič
DMDragan Marusic
Dragan Marusic
PPPrimž Potočnik
Primž Potočnik

1 March 1998 in Discrete Mathematics
Verified
Journal Article
Closed access
AMAleksander Malnič
Aleksander Malnič

1 September 1996 in Journal of Combinatorial Theory, Series B
Verified
Journal Article
Closed access
MJM. Juvan
M. Juvan
AMA. Malnič
A. Malnič
BMB. Mohar
B. Mohar

1 November 2008 in Journal of Combinatorial Theory, Series B
Verified
Journal Article
Closed access
SDShaofei Du
Shaofei Du
AMAleksander Malnič
Aleksander Malnič
DMDragan Marusic
Dragan Marusic