Search arXivSearch

arXiv · 2407.07486

Anzahl theorems for trivially intersecting subspaces generating a non-singular subspace I: symplectic and hermitian forms

Abstract

In this paper, we solve a classical counting problem for non-degenerate forms of symplectic and hermitian type defined on a vector space: given a subspace $π$, we find the number of non-singular subspaces that are trivially intersecting with $π$ and span a non-singular subspace with $π$. Lower bounds for the quantity of such pairs where $π$ is non-singular were first studied in ``Glasby, Niemeyer, Praeger (Finite Fields Appl., 2022)'', which was later improved in ``Glasby, Ihringer, Mattheus (Des. Codes Cryptogr., 2023)'' and generalised in ``Glasby, Niemeyer, Praeger (Linear Algebra Appl., 2022)''. In this paper, we derive explicit formulae, which allow us to give the exact proportion and improve the known lower bounds.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Maarten De Boeck, Geertrui Van de Voorde. 2024-07-19. Anzahl theorems for trivially intersecting subspaces generating a non-singular subspace I: symplectic and hermitian forms. https://doi.org/10.1016/j.laa.2024.07.004

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO