English
Related papers

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

200 papers

Let $I_k = [(2k-1)^2, (2k+1)^2)$ for $k \geq 1$. Starting from the odd-composite matrix $(b_{ij})$ with $b_{ij} = (2i-1)(2j-1)$, introduced by the author in [1], we define for each odd integer $n$ the \emph{matrix multiplicity} $r(n)$, the…

Number Theory · Mathematics 2026-05-22 Wujie Shi

The Cremona group of rank n over a field k is the group of birational automorphisms of the n-dimensional projective space over the field k. We study the minimal dimension such that all finite subgroups of the Cremona group have a faithful…

Algebraic Geometry · Mathematics 2025-07-08 Alexander Duncan , Bailey Heath , Christian Urech

Let $\mathbb{F}$ be a field. Denote by $t_n(\mathbb{F})$ the greatest possible dimension for a vector space of $n$-by-$n$ matrices over $\mathbb{F}$ in which every element is triangularizable over $\mathbb{F}$. It was recently proved that…

Rings and Algebras · Mathematics 2025-09-05 Clément de Seguins Pazzis

Let $n\geq2$ be a natural number. Let $M_n(\mathbb{K})$ be the ring of all $n \times n$ matrices over a field $\mathbb{K}$. Fix natural number $k$ satisfying $1<k\leq n$. Under a mild technical assumption over $\mathbb{K}$ we will show that…

Rings and Algebras · Mathematics 2012-12-05 Willian Versolati Franca

Let $E$ be the elliptic curve $y^2=x(x+1)(x+t)$ over the field $\Fp(t)$ where $p$ is an odd prime. We study the arithmetic of $E$ over extensions $\Fq(t^{1/d})$ where $q$ is a power of $p$ and $d$ is an integer prime to $p$. The rank of $E$…

Number Theory · Mathematics 2013-12-12 Ricardo Conceição , Chris Hall , Douglas Ulmer

Computing supertrees is a central problem in phylogenetics. The supertree method that is by far the most widely used today was introduced in 1992 and is called Matrix Representation with Parsimony analysis (MRP). Matrix Representation using…

Computational Complexity · Computer Science 2011-12-21 Sebastian Böcker , Quang Bao Anh Bui , Francois Nicolas , Anke Truss

We present a new direct proof of a topological representation theorem for oriented matroids in the general rank case. Our proof is based on an earlier rank 3 version. It uses hyperline sequences and the generalized Sch{\"o}nflies theorem.…

Combinatorics · Mathematics 2007-05-23 Juergen Bokowski , Simon King , Susanne Mock , Ileana Streinu

Let ${\rm Mat}_n(\mathbb{F})$ denote the set of square $n\times n$ matrices over a field $\mathbb{F}$ of characteristic different from two. The permanental rank ${\rm prk}\,(A)$ of a matrix $A \in{\rm Mat}_{n}(\mathbb{F})$ is the size of…

Combinatorics · Mathematics 2023-10-30 Alexander Guterman , Igor Spiridonov

Let us call a simple graph on $n\geq 2$ vertices a prime gap graph if its vertex degrees are $1$ and the first $n-1$ prime gaps. We show that such a graph exists for every large $n$, and in fact for every $n\geq 2$ if we assume the Riemann…

In this paper, we employ a version of Stepanov's method, developed by Hanson and Petridis, to prove several results on additive irreducibility of multiplicative subgroups in finite fields of prime order $p$. Specifically, we show that if a…

Number Theory · Mathematics 2025-05-29 Alexander Kalmynin

A framework consists of an undirected graph $G$ and a matroid $M$ whose elements correspond to the vertices of $G$. Recently, Fomin et al. [SODA 2023] and Eiben et al. [ArXiV 2023] developed parameterized algorithms for computing paths of…

Data Structures and Algorithms · Computer Science 2023-05-04 Fedor V. Fomin , Petr A. Golovach , Tuukka Korhonen , Giannos Stamoulis

We show that each real-representable matroid is a minor of a complex-representable excluded minor for real-representability. More generally, for an infinite field $\mathbb{F}_1$ and a field extension $\mathbb{F}_2$, if…

Combinatorics · Mathematics 2019-11-14 Rutger Campbell , Jim Geelen

Let $\mathcal B=\mathcal B_{k,n,p}$ be a random collection of $k$-subsets of $[n]$ where each possible set is present independently with probability $p$. Let $\cal E_{\mathcal B}$ be the event that $\mathcal B$ defines the set of bases of a…

Combinatorics · Mathematics 2026-05-11 Patrick Bennett , Alan Frieze

For a natural number $c$, a $c$-arrangement is an arrangement of dimension $c$ subspaces satisfying the following condition: the sum of any subset of the subspaces has dimension a multiple of $c$. Matroids arising as normalized rank…

Combinatorics · Mathematics 2022-09-21 Lukas Kühne , Geva Yashfe

We extend the splitting operation from binary matroids (Raghunathan et al., 1998) to $p$- matroids, where $p$-matroids refer to matroids representable over $GF(p).$ We also characterize circuits, bases, and independent sets of the resulting…

Combinatorics · Mathematics 2025-07-15 Prashant Malavadkar , Uday Jagadale , Sachin Gunjal

We show that, given a rank 3 affine root system $\Phi$ with Weyl group $W$, there is a unique oriented matroid structure on $\Phi$ which is $W$-equivariant and restricts to the usual matroid structure on rank 2 subsystems. Such oriented…

Combinatorics · Mathematics 2024-10-16 Grant Barkley , Katherine Tung

We investigate class field towers of number fields obtained as fixed fields of modular representations of the absolute Galois group of the rational numbers. First, for each $k\in\{12,16,18,20,22,26\}$, we give explicit rational primes $\l$…

Number Theory · Mathematics 2010-08-17 Kirti Joshi , Cameron McLeman

Two naturally occurring matroids representable over Q are shown to be dual: the {\it cyclotomic matroid} $\mu_n$ represented by the $n^{th}$ roots of unity $1,\zeta,\zeta^2,...,\zeta^{n-1}$ inside the cyclotomic extension $Q(\zeta)$, and a…

Combinatorics · Mathematics 2011-10-05 Jeremy Martin , Victor Reiner

A classic problem in matroid theory is to find subspace arrangements, specifically hyperplane and pseudosphere arrangements, whose intersection posets are isomorphic to a prescribed geometric lattice. Engstr\"om recently showed how to…

Combinatorics · Mathematics 2019-09-04 Steven Klee , Matthew T. Stamps

It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…

Number Theory · Mathematics 2016-04-25 Michele Elia , Federico Pintore
‹ Prev 1 8 9 10 Next ›