English
Related papers

Related papers: The monic rank

200 papers

One of the simplest matrix-valued function with a single variable matrix $X$ is given by $A + BXC$. In this this note, analytical formulas are established for calculating the maximal and minimal ranks of $A + BXC$ when the rank of the…

Optimization and Control · Mathematics 2013-01-17 Yongge Tian

The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation. In the case of groups, the previous best algorithm for…

Computational Complexity · Computer Science 2020-05-21 Jeffrey Finkelstein

A notion of open rank, related with generic power sum decompositions of forms, has recently been introduced in the literature. The main result here is that the maximum open rank for plane quartics is eight. In particular, this gives the…

Algebraic Geometry · Mathematics 2018-04-10 Edoardo Ballico , Alessandro De Paris

Tensors, or multi-linear forms, are important objects in a variety of areas from analytics, to combinatorics, to computational complexity theory. Notions of tensor rank aim to quantify the "complexity" of these forms, and are thus also…

Computational Complexity · Computer Science 2023-06-16 Mandar Juvekar , Arian Nadjimzadah

For a compact smooth manifold $M$ (with boundary) we prove that the topological rank of the diffeomorphism group Diff$_0^k(M)$ is finite for all $k\geq 1$. This extends a result from [2] where the same claim is proved in the special case of…

Group Theory · Mathematics 2015-10-16 Azer Akhmedov

Given a right-infinite word $\bf x$ over a finite alphabet $A$, the rank of $\bf x$ is the size of the smallest set $S$ of words over $A$ such that $\bf x$ can be realized as an infinite concatenation of words in $S$. We show that the…

Formal Languages and Automata Theory · Computer Science 2021-08-13 Jason Bell , Jeffrey Shallit

Following D. Ramakrishnan, we explain how L. Lafforgue's modularity theorem and an analytic theorem of H. Jacquet and J. Shalika can be applied to prove the following result related to the Tate Conjecture: for a smooth, projective,…

Number Theory · Mathematics 2015-08-11 Christopher Lyons

A vector space A of matrices is called rank-critical if any vector space that properly contains A has a strictly higher generic rank. I present a sufficient condition for A to be rank-critical, and apply this condition to prove that certain…

Representation Theory · Mathematics 2017-10-10 Jan Draisma

We consider Bratteli diagrams of finite rank (not necessarily simple) and ergodic invariant measures with respect to the cofinal equivalence relation on their path spaces. It is shown that every ergodic invariant measure (finite or…

Dynamical Systems · Mathematics 2015-03-13 Sergey Bezuglyi , Jan Kwiatkowski , Konstantin Medynets , Boris Solomyak

We establish a relative monadicity theorem for relative monads with dense roots in a virtual equipment, specialising to a relative monadicity theorem for enriched relative monads. In particular, for a dense $\mathbb V$-functor $j \colon A…

Category Theory · Mathematics 2024-10-18 Nathanael Arkor , Dylan McDermott

Asymptotic tensor rank is notoriously difficult to determine. Indeed, determining its value for the $2\times 2$ matrix multiplication tensor would determine the matrix multiplication exponent, a long-standing open problem. On the other…

Computational Complexity · Computer Science 2024-11-26 Matthias Christandl , Koen Hoeberechts , Harold Nieuwboer , Péter Vrana , Jeroen Zuiddam

Given a differential or $q$-difference equation $P$ of order $n$, we prove that the set of exponents of a generalized power series solution has its rational rank bounded by the rational rank of the support of $P$ plus $n$. We also prove…

Classical Analysis and ODEs · Mathematics 2025-02-10 J. Cano , P. Fortuny Ayuso

Given an undirected graph representing similarities between a set of items and an additive measure evaluating the items, we treat the position of a special subset of items in an ordinal ranking through a collection of combinatorial…

Data Structures and Algorithms · Computer Science 2026-05-05 Samuel Boardman

We determine the Waring ranks of all sextic binary forms with complex coefficients using a Geometric Invariant Theory approach. Using the five basic invariants for sextic binary forms, our results give a rapid method to determine the Waring…

Algebraic Geometry · Mathematics 2022-08-10 Alexandru Dimca , Gabriel Sticlaru

Motivated by recent works on statistics of matrices over sets of number theoretic interest, we study matrices with entries from arbitrary finite subsets $\mathcal A$ of finite rank multiplicative groups infields of characteristic zero. We…

Number Theory · Mathematics 2025-02-12 Aaron Manning , Alina Ostafe , Igor E. Shparlinski

Let $\mathbb{F}$ be a field, and $n \geq r>0$ be integers, with $r$ even. Denote by $\mathrm{A}_n(\mathbb{F})$ the space of all $n$-by-$n$ alternating matrices with entries in $\mathbb{F}$. We consider the problem of determining the…

Rings and Algebras · Mathematics 2023-07-21 Clément de Seguins Pazzis

This paper systematically studies finite rank dimension groups, as well as finite dimensional ordered real vector spaces with Riesz interpolation. We provide an explicit description and classification of finite rank dimension groups, in the…

Functional Analysis · Mathematics 2015-06-01 Greg Maloney , Aaron Tikuisis

We introduce the notion of the definable rank of an ordered field, ordered abelian group and ordered set, respectively. We study the relation between the definable rank of an ordered field and the definable rank of the value group of its…

Logic · Mathematics 2026-01-13 Lothar Sebastian Krapp , Salma Kuhlmann , Lasse Vogel

We prove a conjecture of Comon and Ottaviani that typical real Waring ranks of bivariate forms of degree $d$ take all integer values between $\lfloor \frac{d+2}{2}\rfloor$ and $d$. That is we show that for all $d$ and all $\lfloor…

Algebraic Geometry · Mathematics 2012-05-16 Grigoriy Blekherman

We exhibit an algorithm to compute the strongest polynomial (or algebraic) invariants that hold at each location of a given affine program (i.e., a program having only non-deterministic (as opposed to conditional) branching and all of whose…

Logic in Computer Science · Computer Science 2018-05-03 Ehud Hrushovski , Joël Ouaknine , Amaury Pouly , James Worrell