arXiv · math/0612443
Sequences of traces of powers of integral matrices are characterized.The result can be used can be used in character tables of e.g. the symmetric group.
Explore connections, maps & timelines
Gert Almkvist. 2006-12-15. Integrity of ghosts. https://arxiv.org/abs/math/0612443
Cite the original work for its findings. Save a collection to share your selection of sources.
KEEP EXPLORING
For integers $k, \ell \geq 3$, let $\mathrm{ex}(n, \overrightarrow{C_k}, \overrightarrow{C_\ell})$ denote the maximum number of directed cycles of length $k$ in any oriented graph on $n$ vertices which does not contain a directed cycle of length $\ell$. We establish the order of magnitude of $\mathrm{ex}(n, \overrightarrow{C_k}, \overrightarrow{C_\ell})$ for every $k$ and $\ell$ and determine its value up to a lower error term when $k \nmid \ell$ and $\ell$ is large enough. Additionally, we calculate the value of $\mathrm{ex}(n, \overrightarrow{C_k}, \overrightarrow{C_\ell})$ for some other specific pairs $(k, \ell)$ showing that a diverse class of extremal constructions can appear for small values of $\ell$.
We introduce FlagAlgebraToolbox, an extension of SageMath capable of automating flag algebra calculations and optimizations. FlagAlgebraToolbox has a simple interface, can handle a wide range of combinatorial theories, can numerically optimize extremal combinatorial problems and round the results to produce exact proofs. We present the core concepts used in the toolbox, with example workflows.
We study how a prescribed second Betti number constrains the largest eigenvalue of the signless Laplacian on edges of a pure two-dimensional simplicial complex. For each fixed positive second Betti number, we determine all maximizing complexes provided that the number of vertices is sufficiently large. Every maximizer consists of a full cone over a complete graph together with a family of triangles avoiding the apex, any two of which share an edge; the number of added triangles equals the prescribed Betti number. The maximizer is unique up to isomorphism except when this number is three or four, for which we describe all additional extremal complexes. The proof uses homological constraints and Perron vector estimates to establish the full cone structure, followed by an exact Schur complement comparison to classify the added triangles. We also obtain an asymptotic expansion of the maximum spectral radius and extend the extremal result to Betti numbers growing more slowly than the fourth root of the number of vertices. These results provide a two-dimensional counterpart of spectral extremal theorems for connected graphs with a prescribed cyclomatic number.