Enumerating alternating matrix spaces over finite fields with explicit coordinates

Qiao, Y

Enumerating alternating matrix spaces over finite fields with explicit coordinates

Qiao, Y

Permalink

Publisher:: Elsevier BV
Publication Type:: Journal Article
Citation:: Discrete Mathematics, 2021, 344, (11), pp. 112580
Issue Date:: 2021-11-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

The embargo period expires on 30 Nov 2023

Adobe PDF

Download Accepted versionAdobe PDF (463.05 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Qiao, Y https://orcid.org/0000-0003-4334-1449
dc.date.accessioned	2022-01-28T00:07:05Z
dc.date.available	2022-01-28T00:07:05Z
dc.date.issued	2021-11-01
dc.identifier.citation	Discrete Mathematics, 2021, 344, (11), pp. 112580
dc.identifier.issn	0012-365X
dc.identifier.uri	http://hdl.handle.net/10453/153695
dc.description.abstract	We initiate the study of enumerating linear subspaces of alternating matrices over finite fields with explicit coordinates. We present q-analogues of Gilbert's formula for enumerating connected graphs (Gilbert (1956) [5]), and Read's formula for enumerating c-coloured graphs (Read (1960) [14]). We also develop an analogue of Riddell's formula relating the exponential generating function of graphs with that of connected graphs (Riddell's (1951) [15]), building on Eulerian generating functions developed by Srinivasan ((2006) [16]).
dc.language	en
dc.publisher	Elsevier BV
dc.relation	http://purl.org/au-research/grants/arc/DP200100950
dc.relation.ispartof	Discrete Mathematics
dc.relation.isbasedon	10.1016/j.disc.2021.112580
dc.rights	info:eu-repo/semantics/embargoedAccess
dc.subject	0101 Pure Mathematics, 0102 Applied Mathematics, 0802 Computation Theory and Mathematics
dc.subject.classification	Computation Theory & Mathematics
dc.title	Enumerating alternating matrix spaces over finite fields with explicit coordinates
dc.type	Journal Article
utslib.citation.volume	344
utslib.for	0101 Pure Mathematics
utslib.for	0102 Applied Mathematics
utslib.for	0802 Computation Theory and Mathematics
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - QSI - Centre for Quantum Software and Information
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
utslib.copyright.status	open_access	*
utslib.copyright.embargo	2023-11-30T00:00:00+1000Z
dc.date.updated	2022-01-28T00:07:04Z
pubs.issue	11
pubs.publication-status	Published
pubs.volume	344
utslib.citation.issue	11

Abstract:

We initiate the study of enumerating linear subspaces of alternating matrices over finite fields with explicit coordinates. We present q-analogues of Gilbert's formula for enumerating connected graphs (Gilbert (1956) [5]), and Read's formula for enumerating c-coloured graphs (Read (1960) [14]). We also develop an analogue of Riddell's formula relating the exponential generating function of graphs with that of connected graphs (Riddell's (1951) [15]), building on Eulerian generating functions developed by Srinivasan ((2006) [16]).

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/153695