中文
相关论文

相关论文: Rank of matrices with entries from a multiplicativ…

200 篇论文

We use probabilistic methods to find lower bounds on the maximum number, in a graph with domination number \gamma, of dominating sets of size \gamma. We find that we can randomly generate a graph that, w.h.p., is dominated by almost all…

组合数学 · 数学 2013-08-15 Samuel Connolly , Zachary Gabor , Anant Godbole , Bill Kay

We consider the problem of counting the number of possible sets of rankings (called ranking patterns) generated by unfolding models of codimension one. We express the ranking patterns as slices of the braid arrangement and show that all…

组合数学 · 数学 2011-06-10 Hidehiko Kamiya , Akimichi Takemura , Hiroaki Terao

Let $X$ be an infinite linearly ordered set and let $Y$ be a nonempty subset of $X$. We calculate the relative rank of the semigroup $OP(X,Y)$ of all orientation-preserving transformations on $X$ with restricted range $Y$ modulo the…

环与代数 · 数学 2022-06-27 Ilinka Dimitrova , Jörg Koppitz

A fooling-set matrix has nonzero diagonal, but at least one in every pair of diagonally opposite entries is 0. Dietzfelbinger et al. '96 proved that the rank of such a matrix is at least $\sqrt n$. It is known that the bound is tight (up to…

离散数学 · 计算机科学 2016-12-06 Mozhgan Pourmoradnasseri , Dirk Oliver Theis

We use representation theory to construct spaces of matrices of constant rank. These spaces are parametrized by the natural representation of the general linear group or the symplectic group. We present variants of this idea, with more…

代数几何 · 数学 2022-12-09 J. M. Landsberg , L. Manivel

We consider a tuple $\Phi = (\phi_1,\ldots,\phi_m)$ of commuting maps on a finitary matroid $X$. We show that if $\Phi$ satisfies certain conditions, then for any finite set $A\subseteq X$, the rank of $\{\phi_1^{r_1}\cdots\phi_m^{r_m}(a):a…

组合数学 · 数学 2025-02-06 Antongiulio Fornasiero , Elliot Kaplan

Accurate estimation of camera matrices is an important step in structure from motion algorithms. In this paper we introduce a novel rank constraint on collections of fundamental matrices in multi-view settings. We show that in general, with…

计算机视觉与模式识别 · 计算机科学 2017-02-13 Soumyadip Sengupta , Tal Amir , Meirav Galun , Tom Goldstein , David W. Jacobs , Amit Singer , Ronen Basri

How many random entries of an n by m, rank r matrix are necessary to reconstruct the matrix within an accuracy d? We address this question in the case of a random matrix with bounded rank, whereby the observed entries are chosen uniformly…

数据结构与算法 · 计算机科学 2008-12-16 Raghunandan H. Keshavan , Andrea Montanari , Sewoong Oh

In this paper we obtain significant bounds for the number of maximal subgroups of a given index of a finite group. These results allow us to give new bounds for the number of random generators needed to generate a finite $d$-generated group…

It is easy to see that if $\cG$ is a non-abelian group of unitary matrices, then for no members $A$ and $B$ of $\cG$ can the rank of $AB-BA$ be one. We examine the consequences of the assumption that this rank is at most two for a general…

泛函分析 · 数学 2013-06-12 Ali Jafarian , Alexey I. Popov , Mehdi Radjabalipour , Heydar Radjavi

We show that a rank reduction technique for string C-group representations first used for the symmetric groups generalizes to arbitrary settings. The technique permits us, among other things, to prove that orthogonal groups defined on…

群论 · 数学 2019-05-06 Peter A. Brooksbank , Dimitri Leemans

The rank of the matrix multiplication operator for nxn matrices is one of the most studied quantities in algebraic complexity theory. I prove that the rank is at least n^2-o(n^2). More precisely, for any integer p\leq n -1, the rank is at…

计算复杂性 · 计算机科学 2013-10-31 J. M. Landsberg

Let $W_{k,n}^{i}(m)$ denote a matrix with rows and columns indexed by the $k$-subsets and $n$-subsets, respectively, of an $m$-element set. The row $S$, column $T$ entry of $W_{k,n}^{i}(m)$ is $1$ if $|S \cap T| = i$, and is $0$ otherwise.…

组合数学 · 数学 2023-05-09 Joshua E. Ducey , Colby J. Sherwood

We study the closure of the projection of the (nonconvex) cone of rank restricted positive semidefinite matrices onto subsets of the matrix entries. This defines the feasible sets for semidefinite completion problems with restrictions on…

最优化与控制 · 数学 2016-11-01 Ian Davidson , Henry Wolkowicz

We consider groups of finite Morley rank with solvable local subgroups of even and mixed types. We also consider miscellaneous aspects of small groups of finite Morley rank of odd type.

群论 · 数学 2008-09-15 Adrien Deloro , Eric Jaligot

We prove that $\det A\leq 6^\frac{n}{6}$ whenever $A\in\{0,1\}^{n\times n}$ contains at most $2n$ ones. We also prove an upper bound on the determinant of matrices with the $k$-consecutive ones property, a generalisation of the consecutive…

组合数学 · 数学 2017-11-29 Henning Bruhn , Dieter Rautenbach

The rank of a ring $R$ is the supremum of minimal cardinalities of generating sets of $I$ as $I$ ranges over ideals of $R$. Matson showed that every positive integer occurs as the rank of some ring $R$. Motivated by the result of Cohen and…

交换代数 · 数学 2016-05-05 Pete L. Clark

We prove in a large number of cases, that a Zariski dense discrete subgroup of a simple real algebraic group $G$ which contains a higher rank lattice is a lattice in the group $G$. For example, we show that a Zariski dense subgroup of…

群论 · 数学 2025-10-07 Indira Chatterji , T. N. Venkataramana

We investigate questions related to the set $\mathcal{SEP}_d$ consisting of the linear maps $\rho$ acting on $\mathbb{C}^d\otimes \mathbb{C}^d$ that can be written as a convex combination of rank one matrices of the form $xx^*\otimes yy^*$.…

最优化与控制 · 数学 2021-09-30 Sander Gribling , Monique Laurent , Andries Steenkamp

We estimate the frequency of singular matrices and of matrices of a given rank whose entries are parametrised by arbitrary polynomials over the integers and modulo a prime $p$. In particular, in the integer case, we improve a recent bound…

数论 · 数学 2023-10-20 Ali Mohammadi , Alina Ostafe , Igor Shparlinski