English
Related papers

Related papers: On the unique representability of spikes over prim…

200 papers

We use methods of combinatorial number theory to prove that, for each $n>1$ and any prime $p$, some homotopy group $\pi_i(SU(n))$ contains an element of order $p^{n-1+ord_p([n/p]!)}$, where $ord_p(m)$ denotes the largest integer $\alpha$…

Algebraic Topology · Mathematics 2007-05-23 Donald M. Davis , Zhi-Wei Sun

Let $R$ be a (not necessarily commutative) ring whose additive group is finitely generated and let $U_n(R) \subset GL_n(R)$ be the group of upper-triangular unipotent matrices over $R$. We study how the homology groups of $U_n(R)$ vary with…

Algebraic Topology · Mathematics 2020-03-18 Andrew Putman , Steven V Sam , Andrew Snowden

Any multilinear non-central polynomial $p$ (in several noncommuting variables) takes on values of degree $n$ in the matrix algebra $M_n(F)$ over an infinite field $F$. The polynomial $p$ is called {\it $\nu$-central} for $M_n(F)$ if $p^\nu$…

Algebraic Geometry · Mathematics 2017-12-05 Alexei Kanel-Belov , Sergey Malev , Louis Rowen

Using a new definition of rank for representations of semisimple groups sharp results are proved for the decay of matrix coefficients of unitary representations of two types of non-split $p$-adic simple algebraic groups of exceptional type.…

Representation Theory · Mathematics 2007-05-23 Hadi Salmasian

Let $s,n \ge 2$ be integers. We give a qualitative structural description of every matroid $M$ that is spanned by a frame matroid of a complete graph and has no $U_{s,2s}$-minor and no rank-$n$ projective geometry minor, showing that every…

Combinatorics · Mathematics 2016-02-17 Jim Geelen , Peter Nelson

For natural numbers $k<n$ we study the graphs $T_{n,k}:=K_{k}\lor\overline{K_{n-k}}$. For $k=1$, $T_{n,1}$ is the star $S_{n-1}$. For $k>1$ we refer to $T_{n,k}$ as a \emph{graph of pyramids}. We prove that the graphs of pyramids are…

Combinatorics · Mathematics 2023-10-10 Noam Krupnik , Abraham Berman

A permutation graph $G_\pi$ is a simple graph with vertices corresponding to the elements of $\pi$ and an edge between $i$ and $j$ when $i$ and $j$ are inverted in $\pi$. A set of vertices $D$ is said to dominate a graph $G$ when every…

Among those real symmetric matrices whose graph is a given tree $T$, the maximum multiplicity $M(T)$ that can be attained by an eigenvalue is known to be the path cover number of $T$. We say that a tree is $k$-NIM if, whenever an eigenvalue…

Combinatorics · Mathematics 2022-08-12 Charles R. Johnson , George Tsoukalas , Greyson C. Wesley , Zachary Zhao

A positroid is a special case of a realizable matroid, that arose from the study of totally nonnegative part of the Grassmannian by Postnikov. Postnikov demonstrated that positroids are in bijection with certain interesting classes of…

Combinatorics · Mathematics 2018-07-31 Robert Mcalmon , SuHo Oh

Let $G=\Sp(2g,\mathbb{Z})$ be the symplectic group over the integers. Given $m\in \mathbb{N}$, it is natural to ask if there exists a non-trivial matrix $A\in G$ such that $A^{m}=I$, where $I$ is the identity matrix in $G$. In this paper,…

Group Theory · Mathematics 2013-08-23 Kumar Balasubramanian , Ganesh Ji Omar

We extend the notion of matroid representations by matrices over fields and consider new representations of matroids by matrices over finite semirings, more precisely over the boolean and the superboolean semirings. This idea of…

Combinatorics · Mathematics 2011-03-03 Zur Izhakian , John Rhodes

This article gives a new upper bound for the resurgence number of symbolic powers of matroidal configuration in the following situations: the height of the matroidal configuration is big, or the height is small, and the corresponding…

Commutative Algebra · Mathematics 2025-11-18 Haoxi Hu

The Steiner distance of a set of vertices in a graph is the fewest number of edges in any connected subgraph containing those vertices. The order-$k$ Steiner distance hypermatrix of an $n$-vertex graph is the $n \times \cdots \times n$ ($k$…

Combinatorics · Mathematics 2024-03-05 Joshua Cooper , Zhibin Du

The N distinct prime numbers that make up a composite number M allow $2^{N-1}$ bi partioning into two relatively prime factors. Each such pair defines a pair of conjugate representations. These pairs of conjugate representations, each of…

Quantum Physics · Physics 2007-05-23 M. Revzen , A. Mann , J. Zak

For all positive integers $\ell$ and $r$, we determine the maximum number of elements of a simple rank-$r$ positroid without the rank-$2$ uniform matroid $U_{2,\ell+2}$ as a minor, and characterize the matroids with the maximum number of…

Combinatorics · Mathematics 2025-12-18 Jonathan Boretsky , Zach Walsh

Let $F$ be a $p$-adic field. In this article, we consider representations of split special orthogonal groups $\mathrm{SO}_{2n+1}(F)$ and symplectic groups $\mathrm{Sp}_{2n}(F)$ of rank $n$. We denote by $\pi_1 \times \ldots \times \pi_r…

Representation Theory · Mathematics 2025-11-04 Barbara Bošnjak , Alexander Stadler

Let $F$ be a real quadratic field in which a fixed prime $p$ is inert, and $E_0$ be an imaginary quadratic field in which $p$ splits; put $E=E_0 F$. Let ${{\rm Sh}}_{1,n-1}$ be the special fiber over $\mathbb{F}_{p^2}$ of the Shimura…

Number Theory · Mathematics 2026-01-21 Zijie Tao

Let $N_n(F)$ denote the ring of strictly upper triangular matrices with entries in a field $F$ of characteristic zero and center $Z(N_n(F))$. We characterize the $2$-power commuting maps over $N_n(F)$, maps satisfying the identity…

Rings and Algebras · Mathematics 2025-11-21 Jordan Bounds

Let $\mathbb{F}_q$ stand for the finite field of odd characteristic $p$ with $q$ elements ($q=p^{n},n\in \mathbb{N} $) and $\mathbb{F}_q^*$ denote the set of all the nonzero elements of $\mathbb{F}_{q}$. Let $m$ and $t$ be positive…

Number Theory · Mathematics 2016-03-03 Shuangnian Hu , Shaofang Hong

Say that A is a Hadamard factorization of the identity I_n of size n if the entrywise product of A and the transpose of A is I_n. It can be easily seen that the rank of any Hadamard factorization of the identity must be at least sqrt{n}.…

Computational Complexity · Computer Science 2013-10-29 Aya Hamed , Troy Lee