中文
相关论文

相关论文: Nonisomorphic Ordered Sets with Arbitrarily Many R…

200 篇论文

The purpose of this paper is to study minimal monads associated to a rank two vector bundle $\mathcal E$ on $\mathbb P^n$. In particular, we study situations where $\mathcal E$ has $H^i_*(\mathcal E) =0$ for $1<i<n-1$, except for one pair…

代数几何 · 数学 2022-02-02 F. Malaspina , A. P. Rao

This paper presents various worst-case results on the positive semidefinite (psd) rank of a nonnegative matrix, primarily in the context of polytopes. We prove that the psd rank of a generic n-dimensional polytope with v vertices is at…

最优化与控制 · 数学 2014-06-03 João Gouveia , Richard Z. Robinson , Rekha R. Thomas

We prove (without exceptions) the existence of irredundant tensor decompositions with the number of addenda equal to rank $+1$. We also discuss the existence of decompositions with more than the tensor rank terms, which are concise, while…

代数几何 · 数学 2020-02-17 Edoardo Ballico

In this paper, we study the symmetric rank of products of linear forms and an irreducible quadratic form. The main result presents a new, non-trivial lower bound for the rank, and the arguments rely on the apolarity lemma. In the special…

代数几何 · 数学 2026-01-07 Liena Colarte-Gómez , Francesco Galuppi

We prove that two n-by-n matrices A and B have their rank-k numerical ranges $\Lambda_k(A)$ and $\Lambda_k(B)$ equal to each other for all k, $1\le k\le \lfloor n/2\rfloor+1$, if and only if their Kippenhahn polynomials…

泛函分析 · 数学 2013-10-22 Hwa-Long Gau , Pei Yuan Wu

We consider the problem of finding, for two pairs $(s_1,t_1)$ and $(s_2,t_2)$ of vertices in an undirected graphs, an $(s_1,t_1)$-path $P_1$ and an $(s_2,t_2)$-path $P_2$ such that $P_1$ and $P_2$ share no edges and the length of each $P_i$…

数据结构与算法 · 计算机科学 2015-09-21 Leizhen Cai , Junjie Ye

Let K<x,y> be the free associative algebra of rank 2 over an algebraically closed constructive field of any characteristic. We present an algorithm which decides whether or not two elements in K<x,y> are equivalent under an automorphism of…

环与代数 · 数学 2007-05-23 Vesselin Drensky , Jie-Tai Yu

In this paper we compute the rank and exhibit a presentation for the monoids of all $P$-stable and $P$-order preserving partial permutations on a finite set $\Omega$, with $P$ an ordered uniform partition of $\Omega$. These (inverse)…

环与代数 · 数学 2019-05-29 Rita Caneco , Vítor H. Fernandes , Teresa M. Quinteiro

We calculate the possible Scott ranks of countable models of Peano arithmetic. We show that no non-standard model can have Scott rank less than $\omega$ and that non-standard models of true arithmetic must have Scott rank greater than…

逻辑 · 数学 2022-08-04 Antonio Montalbán , Dino Rossegger

We show that for finite n at least 3, every first-order axiomatisation of the varieties of representable n-dimensional cylindric algebras, diagonal-free cylindric algebras, polyadic algebras, and polyadic equality algebras contains an…

逻辑 · 数学 2013-05-22 Jannis Bulian , Ian Hodkinson

The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. Akbari, Cameron, and Khosrovshahi conjectured that the…

组合数学 · 数学 2014-04-29 E. Ghorbani , A. Mohammadian , B. Tayfeh-Rezaie

For an $n \times n$ matrix $M$ with entries in $\mathbb{Z}_2$ denote by $R(M)$ the minimal rank of all the matrices obtained by changing some numbers on the main diagonal of $M$. We prove that for each non-negative integer $k$ there is a…

组合数学 · 数学 2021-04-22 Eugene Kogan

We prove that for every pair of quantum isomorphic graphs, their block trees and their block graphs are isomorphic, and that such an isomorphism can be chosen so that the corresponding blocks are quantum isomorphic -- in particular,…

组合数学 · 数学 2025-10-23 Amaury Freslon , Paul Meunier , Pegah Pournajafi

We prove that for any integers $p\geq k\geq 3$ and any $k$-tuple of positive integers $(n_1,\ldots ,n_k)$ such that $p=\sum _{i=1}^k{n_i}$ and $n_1\geq n_2\geq \ldots \geq n_k$, the condition $n_1\leq {p\over 2}$ is necessary and sufficient…

组合数学 · 数学 2018-08-22 Daniela Ferrero , Linda Lesniak

We construct a pair of non-commutative rank 8 association schemes from a rank 3 non-symmetric association scheme. For the pair, two association schemes have the same character table but different Frobenius-Schur indicators. This situation…

组合数学 · 数学 2021-09-06 Akihide Hanaki , Masayoshi Yoshikawa

Constructing lattice isomorphic line arrangements that are not lattice isotopic is a complex yet fundamental task. In this paper, we focus on such pairs but which are not Galois conjugated, referred to as nonarithmetic pairs. Splitting…

代数几何 · 数学 2024-09-27 Benoît Guerville-Ballé

We prove that there exists an algorithm for determining whether two piecewise-linear spatial graphs are isomorphic. In its most general form, our theorem applies to spatial graphs furnished with vertex colorings, edge colorings and/or edge…

几何拓扑 · 数学 2024-05-22 Stefan Friedl , Lars Munser , José Pedro Quintanilha , Yuri Santos Rego

Let $X/\mathbb{F}_{q}$ be a smooth, geometrically connected, quasiprojective variety. Let $\mathcal{E}$ be a semisimple overconvergent $F$-isocrystal on $X$. Suppose that irreducible summands $\mathcal{E}_i$ of $\mathcal E$ have rank 2,…

代数几何 · 数学 2022-06-17 Raju Krishnamoorthy , Ambrus Pál

In this paper, we consider a one-parameter family of degree $d\ge 2$ rational maps with an automorphism group containing the cyclic group of order $d$. We construct a polynomial whose roots correspond to parameter values for which the…

数论 · 数学 2021-01-26 Minsik Han

The order type of a point set in $R^d$ maps each $(d{+}1)$-tuple of points to its orientation (e.g., clockwise or counterclockwise in $R^2$). Two point sets $X$ and $Y$ have the same order type if there exists a mapping $f$ from $X$ to $Y$…

计算几何 · 计算机科学 2013-11-06 Greg Aloupis , John Iacono , Stefan Langerman , Özgür Özkan