中文
相关论文

相关论文: Cycles and 1-unconditional matrices

200 篇论文

We prove that if $X$ is a complex strictly monotone sequence space with $1$-unconditional basis, $Y \subseteq X$ has no bands isometric to $\ell_2^2$ and $Y$ is the range of norm-one projection from $X$, then $Y$ is a closed linear span a…

泛函分析 · 数学 2008-02-03 Beata Randrianantoanina

Let $\phi(x) = x^d + c$ be an integral polynomial of degree at least 2, and consider the sequence $(\phi^n(0))_{n=0}^\infty$, which is the orbit of $0$ under iteration by $\phi$. Let $D_{d,c}$ denote the set of positive integers $n$ for…

数论 · 数学 2016-08-09 Annie S. Chen , T. Alden Gassert , Katherine E. Stange

Given a symmetric $n\times n$ matrix $P$ with $0 \le P(u, v)\le 1$, we define a random graph $G_{n, P}$ on $[n]$ by independently including any edge $\{u, v\}$ with probability $P(u, v)$. For $k\ge 1$ let $\mathcal{A}_k$ be the property of…

组合数学 · 数学 2020-12-23 Tony Johansson

We give a canonical form of matrices of a cycle of linear or semilinear mapping V_1 --- V_2 --- ... --- V_t --- V_1 in which all V_i are complex vector spaces, each line is an arrow ---> or <---, and each arrow denotes a linear or…

We prove that for every integer $k$, there exists $\varepsilon > 0$ such that for every n-vertex graph $G$ with no pivot-minor isomorphic to $C_k$, there exist disjoint sets $A,B \subseteq V(G)$ such that $|A|,|B| \geq \varepsilon n$, and…

组合数学 · 数学 2021-07-02 Jaehoon Kim , Sang-il Oum

We characterise the Schur bounded patterns of ideals of compact operators that are not closed under submajorisation, in particular the Schatten ideals $\mathcal{C}_p$ with $0<p<1.$ Conversely we characterise the ideals that are not closed…

泛函分析 · 数学 2026-05-11 Edward McDonald , Fedor Sukochev , Dmitriy Zanin

There has been extensive research on cycle lengths in graphs with large minimum degree. In this paper, we obtain several new and tight results in this area. Let $G$ be a graph with minimum degree at least $k+1$. We prove that if $G$ is…

组合数学 · 数学 2015-09-01 Chun-Hung Liu , Jie Ma

This note provides a complete solution to a certain version of the edge-isoperimetric problem for powers of a cycle graph. Namely, it shows that the maximum number of edges inside a vertex subset of $C_n^s$ of size $k$ is achieved by a set…

组合数学 · 数学 2026-01-13 Kristiyan Vasilev

We introduce the notion of a regular mapping on a non-commutative $L_p$-space associated to a hyperfinite von Neumann algebra for $1\le p\le \infty$. This is a non-commutative generalization of the notion of regular or order bounded map on…

泛函分析 · 数学 2016-09-06 Gilles Pisier

Let $\mathcal{M}$ be a semifinite von Nemann algebra equipped with an increasing filtration $(\mathcal{M}_n)_{n\geq 1}$ of (semifinite) von Neumann subalgebras of $\mathcal{M}$. For $0<p <\infty$, let $\mathsf{h}_p^c(\mathcal{M})$ denote…

算子代数 · 数学 2021-08-17 Narcisse Randrianantoanina

We characterize all orientations of cycles $C$ for which for every fixed $\varepsilon > 0$ there exists a constant $c \geq 1$ such that every digraph $D$ without loops or parallel arcs with $\chi(D) \geq c$ and minimum out-degree at least…

组合数学 · 数学 2025-03-27 Hidde Koerts , Benjamin Moore , Sophie Spirkl

The Gram matrix is defined for Bessel sequences by combining synthesis with subsequent analysis operators. If different sequences are used and an operator U is inserted we reach so called U-cross Gram matrices. This can be seen as…

泛函分析 · 数学 2020-10-21 Peter Balazs , Mitra Shamsabadi , Ali Akbar Arefijamaal , Asghar Rahimi

A bipartite graph on 2n vertices is bipancyclic if it contains cycles of all even lengths from 4 to 2n. In this paper we prove that the random bipartite graph $G(n,n,p)$ with $p(n)\gg n^{-2/3}$ asymptotically almost surely has the following…

组合数学 · 数学 2012-12-17 Yilun Shang

A classic result of Erd\H{o}s and, independently, of Bondy and Simonovits says that the maximum number of edges in an $n$-vertex graph not containing $C_{2k}$, the cycle of length $2k$, is $O( n^{1+1/k})$. Simonovits established a…

组合数学 · 数学 2020-09-16 Tao Jiang , Liana Yepremyan

We study model-theoretic stability and independence in Banach lattices of the form $L_p(X,U,\mu)$, where $1 \leq p < \infty$. We characterize non-dividing using concepts from analysis and show that canonical bases exist as tuples of real…

逻辑 · 数学 2014-02-10 Itaï Ben Yaacov , Alexander Berenstein , C. Ward Henson

Write $\mathcal{C}(G)$ for the cycle space of a graph $G$, $\mathcal{C}_\kappa(G)$ for the subspace of $\mathcal{C}(G)$ spanned by the copies of the $\kappa$-cycle $C_\kappa$ in $G$, $\mathcal{T}_\kappa$ for the class of graphs satisfying…

组合数学 · 数学 2018-07-25 Jacob D. Baron , Jeff Kahn

For $k \ge 4$, a loose $k$-cycle $C_k$ is a hypergraph with distinct edges $e_1, e_2, \ldots, e_k$ such that consecutive edges (modulo $k$) intersect in exactly one vertex and all other pairs of edges are disjoint. Our main result is that…

组合数学 · 数学 2025-01-29 Dhruv Mubayi , Lujia Wang

In this article, we establish initially regular sequences on cycles of the form $C_{3n+2}$ for $n\ge 1$, in the sense of \cite{FHM-ini}. These sequences accurately compute the depth of these cycles, completing the case of finding effective…

交换代数 · 数学 2023-09-15 Le Tran

In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain…

组合数学 · 数学 2021-01-27 Jun Gao , Qingyi Huo , Chun-Hung Liu , Jie Ma

In this paper it is proved, that for every prime number p, the set of cyclic p-roots in C^p is finite. Moreover the number of cyclic p-roots counted with multiplicity is equal to (2p-2)!/(p-1)!^2. In particular, the number of complex…

交换代数 · 数学 2008-03-19 Uffe Haagerup