English
Related papers

Related papers: Cycles and 1-unconditional matrices

200 papers

We study unconditional subsequences of the canonical basis e_rc of elementary matrices in the Schatten class S^p. They form the matrix counterpart to Rudin's Lambda(p) sets of integers in Fourier analysis. In the case of p an even integer,…

Functional Analysis · Mathematics 2017-08-21 Asma Harcharras , Stefan Neuwirth , Krzysztof Oleszkiewicz

We investigate several aspects of almost 1-unconditionality. We characterize the metric unconditional approximation property UMAP in terms of ``block unconditionality''. Then we focus on translation invariant subspaces $L^p_E(T)$ and…

Functional Analysis · Mathematics 2008-02-03 Stefan Neuwirth

A binary matrix has the consecutive ones property (C1P) if it is possible to order the columns so that all 1s are consecutive in every row. In [McConnell, SODA 2004 768-777] the notion of incompatibility graph of a binary matrix was…

Data Structures and Algorithms · Computer Science 2011-09-06 Mehrnoush Malekesmaeili , Cedric Chauve , Tamon Stephen

In this paper we study cycles in random bipartite graph $G(n,n,p)$. We prove that if $p\gg n^{-2/3}$, then $G(n,n,p)$ a.a.s. satisfies the following. Every subgraph $G'\subset G(n,n,p)$ with more than $(1+o(1))n^2p/2$ edges contains a cycle…

Combinatorics · Mathematics 2013-10-15 Yilun Shang

Given two graphs, a mapping between their edge-sets is cycle-continuous, if the preimage of every cycle is a cycle. The motivation for this notion is Jaeger's conjecture that for every bridgeless graph there is a cycle-continuous mapping to…

Combinatorics · Mathematics 2013-01-01 Robert Šámal

Let $\mathcal{H}$ be a given finite (possibly empty) family of connected graphs, each containing a cycle, and let $G$ be an arbitrary finite $\mathcal{H}$-free graph with minimum degree at least $k$. For $p \in [0,1]$, we form a $p$-random…

Combinatorics · Mathematics 2014-01-17 Michael Krivelevich , Wojciech Samotij

The paper contains three results, the common feature of which is that they deal with the Schatten $p$ class. The first is a presentation of a new complemented subspace of $C_p$ in the reflexive range (and $p\not= 2$). This construction…

Functional Analysis · Mathematics 2015-01-28 Gideon Schechtman

A $(0,1)$-matrix has the consecutive-ones property (C1P) if its columns can be permuted to make the $1$'s in each row appear consecutively. This property was characterised in terms of forbidden submatrices by Tucker in 1972. Several graph…

Combinatorics · Mathematics 2022-07-05 Guillermo Durán , Nina Pardal , Martín D. Safe

Let $D$ be a digraph of order $p\geq5$ with minimum degree at least $p-1$ and with minimum semi-degree at least $p/2-1$. In his excellent and renowned paper, ``Long Cycles in Digraphs" (Proc. London Mathematical Society (3), 42 (1981),…

Combinatorics · Mathematics 2025-10-31 Samvel Kh. Darbinyan

We conjecture that the balanced complete bipartite graph $K_{\lfloor n/2 \rfloor,\lceil n/2 \rceil}$ contains more cycles than any other $n$-vertex triangle-free graph, and we make some progress toward proving this. We give equivalent…

Combinatorics · Mathematics 2014-10-30 Stephane Durocher , David S. Gunderson , Pak Ching Li , Matthew Skala

The infinite upper triangular Pascal matrix is $T = [\binom{j}{i}]$ for $0\leq i,j$. It is easy to see that any leading principle square submatrix is triangular with determinant $1$, hence invertible. In this paper, we investigate the…

Numerical Analysis · Mathematics 2017-02-13 Scott N. Kersey

We introduce sequentially $S_r$ modules over a commutative graded ring and sequentially $S_r$ simplicial complexes. This generalizes two properties for modules and simplicial complexes: being sequentially Cohen-Macaulay, and satisfying…

Commutative Algebra · Mathematics 2010-04-21 Hassan Haghighi , Naoki Terai , Siamak Yassemi , Rahim Zaare-Nahandi

A binary matrix $M$ has the consecutive ones property ($C1P$) for rows (resp. columns) if there is a permutation of its columns (resp. rows) that arranges the ones consecutively in all the rows (resp. columns). If $M$ has the $C1P$ for rows…

Data Structures and Algorithms · Computer Science 2018-11-14 M R Rani , R Subashini , Mohith Jagalmohanan

Let $F$ be any field of characteristic $p$. It is well-known that there are exactly $p$ inequivalent indecomposable representations $V_1,V_2,...,V_p$ of $C_p$ defined over $F$. Thus if $V$ is any finite dimensional $C_p$-representation…

Rings and Algebras · Mathematics 2011-10-18 David L. Wehlau

Given a positive integer $p$, we consider $W^{1,p}$-maps from a Euclidean domain of dimension $p+1$ into a closed Riemannian manifold $\mathcal{N}$. The target manifold is required to satisfy suitable topological conditions; in particular,…

Functional Analysis · Mathematics 2026-05-28 Giacomo Canevari , Giandomenico Orlandi

The main result of the paper is that a system of invariant subspaces of a (completely non-unitary) Hilbert space contraction $T$ with finite defects (rank$(I-T^*T)<\infty$, rank$(I-TT^*)<\infty$) is an unconditional basis (Riesz basis) if…

Functional Analysis · Mathematics 2016-09-06 Serguei Treil

Let $D$ be a digraph on $p\geq 5$ vertices with minimum degree at least $p-1$ and with minimum semi-degree at least $p/2-1$. For $D$ (unless some extremal cases) we present a detailed proof of the following results [12]: (i) $D$ contains…

Combinatorics · Mathematics 2011-11-09 S. Kh. Darbinyan

As is well known, any complex cyclic matrix $A$ is similar to the unique companion matrix associated with the minimal polynomial of $A$. On the other hand, a cyclic matrix over a division ring $\mathbb F$ is similar to a companion matrix of…

Rings and Algebras · Mathematics 2021-12-07 Vladimir Bolotnikov

Let $G$ be a graph on $n$ vertices and $C'=v_0v_1\cdots v_{p-1}v_0$ a vertex sequence of $G$ with $p\geq 3$ ($v_i\neq v_j$ for all $i,j=0,1,\ldots,p-1$, $i\neq j$). If for any successive vertices $v_i$, $v_{i+1}$ on $C'$, either…

Combinatorics · Mathematics 2016-01-08 Ruonan Li , Bo Ning , Shenggui Zhang

A Berge cycle of length $\ell$ in a hypergraph $\mathcal{H}$ is a sequence of alternating vertices and edges $v_0e_0v_1e_1...v_\ell e_\ell v_0$ such that $\{v_i,v_{i+1}\}\subseteq e_i$ for all $i$, with indices taken modulo $\ell$. For $n$…

Combinatorics · Mathematics 2025-05-02 Teegan Bailey , Isaiah Hollars , Yupei Li , Ruth Luo
‹ Prev 1 2 3 10 Next ›