Related papers: Cycles and 1-unconditional matrices

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

In the present paper we study unconditionally $p$-converging operators and Dunford-Pettis property of order $p$. New characterizations of unconditionally $p$-converging operators and Dunford-Pettis property of order $p$ are established. Six…

We show that if pn >> log n, the binomial random graph G_{n,p} has an approximate Hamilton decomposition. More precisely, we show that in this range G_{n,p} contains a set of edge-disjoint Hamilton cycles covering almost all of its edges.…

A tight cycle in an $r$-uniform hypergraph $\mathcal{H}$ is a sequence of $\ell\geq r+1$ vertices $x_1,\dots,x_{\ell}$ such that all $r$-tuples $\{x_{i},x_{i+1},\dots,x_{i+r-1}\}$ (with subscripts modulo $\ell$) are edges of $\mathcal{H}$.…

We show that for any set of n distinct points in the complex plane, there exists a polynomial p of degree at most n+1 so that the corresponding Newton map, or even the relaxed Newton map, for p has the given points as a super-attracting…

A point $p$ on a smooth complex projective curve $C$ of genus $g>3$ is subcanonical if the divisor $(2g-2)p$ is canonical. In the moduli space of pointed curves, the subcanonical locus is described by pairs $(C,p)$ as above, and it consists…

In this paper we study the eigenvalues of the laplacian matrices of the cyclic graphs with one edge of weight $\alpha$ and the others of weight $1$. We denote by $n$ the order of the graph and suppose that $n$ tends to infinity. We notice…

This paper investigates entropic matroids, that is, matroids whose rank function is given as the Shannon entropy of random variables. In particular, we consider $p$-entropic matroids, for which the random variables each have support of…

Long paths and cycles in sparse random graphs and digraphs were studied intensively in the 1980's. It was finally shown by Frieze in 1986 that the random graph $\cG(n,p)$ with $p=c/n$ has a cycle on at all but at most $(1+\epsilon)ce^{-c}n$…

We introduce a variational notion of essential spectrum for the Dirichlet $p-$Laplacian. We then extend the classical Persson Theorem to this nonlinear setting. This result provides a geometric characterization of the bottom of the…

We find exact and asymptotic formulas for the number of pairs $(p,q)$ of $N$-cycles such that the all cycles of the product $p\cdot q$ have lengths from a given integer set. We then apply these results to prove a surprisingly high lower…

In a graph G, cardinality of the smallest ordered set of vertices that distinguishes every element of V (G) is the (vertex) metric dimension of G. Similarly, the cardinality of such a set is the edge metric dimension of G, if it…

For all positive integers $s$ and $t$ exceeding one, a matroid $M$ on $n$ elements is {\em nearly $(s, t)$-cyclic} if there is a cyclic ordering $\sigma$ of its ground set such that every $s-1$ consecutive elements of $\sigma$ are contained…

Given a graph $G$ and probability $p$, we form the random subgraph $G_p$ by retaining each edge of $G$ independently with probability $p$. Given $d\in\mathbb{N}$ and constants $0<c<1, \varepsilon>0$, we show that if every subset $S\subseteq…

For positive integers $r > \ell$, an $r$-uniform hypergraph is called an $\ell$-cycle if there exists a cyclic ordering of its vertices such that each of its edges consists of $r$ consecutive vertices, and such that every pair of…

We study the families of measures on Carnot groups that have vanishing $p$-module, which we call $p$-exceptional families. We found necessary and sufficient condition for the family of intrinsic Lipschitz surfaces passing through a common…

Fix some $p\in[0,1]$ and a positive integer $n$. The discrete Bak-Sneppen model is a Markov chain on the space of zero-one sequences of length $n$ with periodic boundary conditions. At each moment of time a minimum element (typically, zero)…

A bipartite graph is called bipancyclic if it contains cycles of every even length from four up to the number of vertices in the graph. A theorem of Schmeichel and Mitchem states that for $n \geq 4$, every balanced bipartite graph on $2n$…

We give canonical matrices of a pair (A,B) consisting of a nondegenerate form B and a linear operator A satisfying B(Ax,Ay)=B(x,y) on a vector space over F in the following cases: (i) F is an algebraically closed field of characteristic…

We introduce the cycle intersection graph of a graph, an adaptation of the cycle graph of a graph, and use the structure of these graphs to prove an upper bound for the decycling number of all even graphs. This bound is shown to be…