English
Related papers

Related papers: Cycles and 1-unconditional matrices

200 papers

A general explicit upper bound is obtained for the proportion $P(n,m)$ of elements of order dividing $m$, where $n-1 \le m \le cn$ for some constant $c$, in the finite symmetric group $S_n$. This is used to find lower bounds for the…

Group Theory · Mathematics 2014-05-05 Alice C. Niemeyer , Cheryl E. Praeger

We investigate $(0,1)$-matrices that are {\em convex}, which means that the ones are consecutive in every row and column. These matrices occur in discrete tomography. The notion of ranked essential sets, known for permutation matrices, is…

Combinatorics · Mathematics 2021-01-13 Richard A. Brualdi , Geir Dahl

In this paper, we give formulas for $v$-number of edge ideals of some graphs like path, cycle, 1-clique sum of a path and a cycle, 1-clique sum of two cycles and join of two graphs. For an $\mathfrak{m}$-primary monomial ideal $I\subset…

Commutative Algebra · Mathematics 2023-08-21 Prativa Biswas , Mousumi Mandal

The work considers an equivalence relation in the set of all $n\times m$ matrices with entries in the set $[p]=\{ 0,1,\ldots , p-1 \}$. In each element of the factor-set generated by this relation, we define the concept of canonical matrix,…

Combinatorics · Mathematics 2021-08-02 Krasimir Yordzhev

We prove upper and lower bounds for the spectral condition number of rectangular Vandermonde matrices with nodes on the complex unit circle. The nodes are "off the grid", pairs of nodes nearly collide, and the studied condition number grows…

Numerical Analysis · Mathematics 2019-10-23 Stefan Kunis , Dominik Nagel

In this paper we prove a sufficient condition for the existence of matchings in arbitrary groups and its linear analogue, which lead to some generalizations of the existing results in the theory of matchings in groups and central extensions…

Combinatorics · Mathematics 2019-01-01 Mohsen Aliabadi , Majid Hadian , Amir Jafari

We formulate and study the set of coupled nonlinear differential equations which define a series of shape invariant potentials which repeats after a cycle of $p$ iterations. These cyclic shape invariant potentials enlarge the limited…

High Energy Physics - Phenomenology · Physics 2009-10-30 U. P. Sukhatme , C. Rasinariu , A. Khare

Let $G$ be a finite group. Let $K/k$ be a Galois extension of number fields with Galois group isomorphic to $G$, and let $C \subseteq \mathrm{Gal}(K/k) \simeq G$ be a conjugacy invariant subset. It is well known that there exists an…

Number Theory · Mathematics 2026-01-01 Peter J. Cho , Robert J. Lemke Oliver , Asif Zaman

For a graph $G$ and $p\in [0,1]$, let $G_p$ arise from $G$ by deleting every edge mutually independently with probability $1-p$. The random graph model $(K_n)_p$ is certainly the most investigated random graph model and also known as the…

Combinatorics · Mathematics 2015-12-16 Stefan Ehard , Felix Joos

A Hamilton Berge cycle of a hypergraph on $n$ vertices is an alternating sequence $(v_1, e_1, v_2, \ldots, v_n, e_n)$ of distinct vertices $v_1, \ldots, v_n$ and distinct hyperedges $e_1, \ldots, e_n$ such that $\{v_1,v_n\}\subseteq e_n$…

Combinatorics · Mathematics 2019-03-22 Dennis Clemens , Julia Ehrenmüller , Yury Person

Let $D$ be a $k$-regular bipartite tournament on $n$ vertices. We show that, for every $p$ with $2 \le p \le n/2-2$, $D$ has a cycle $C$ of length $2p$ such that $D \setminus C$ is hamiltonian unless $D$ is isomorphic to the special digraph…

Combinatorics · Mathematics 2021-02-10 Stéphane Bessy , Jocelyn Thiebaut

An $r$-uniform linear cycle of length $\ell$, denoted by $C^r_{\ell}$, is an $r$-graph with $\ell$ edges $e_1,e_2,\dots,e_{\ell}$ where $e_i=\{v_{(r-1)(i-1)},v_{(r-1)(i-1)+1},\dots,v_{(r-1)i}\}$ (here $v_0=v_{(r-1)\ell}$). For $0<\delta<1$…

Combinatorics · Mathematics 2025-04-10 Lirong Deng , Jie Han , Jiaxi Nie , Sam Spiro

For a given finite graph $G$ of minimum degree at least $k$, let $G_{p}$ be a random subgraph of $G$ obtained by taking each edge independently with probability $p$. We prove that (i) if $p \ge \omega/k$ for a function $\omega=\omega(k)$…

Combinatorics · Mathematics 2013-05-28 Michael Krivelevich , Choongbum Lee , Benny Sudakov

Let $p$ be a prime integer and $F$ the function field in two algebraically independent variables over a smaller field $F_0$. We prove that if $\operatorname{char}(F_0)=p\geq 3$ then there exist $p^2-1$ cyclic algebras of degree $p$ over $F$…

Rings and Algebras · Mathematics 2021-04-20 Adam Chapman

If V is the vertex sequence of a symmetric 2t-cycle in the hypercube graph with the vertices {1,-1}^t, then for any vertex T of the graph there exists a unique inclusion-minimal subset of V such that T is the sum of its elements. We present…

Combinatorics · Mathematics 2018-11-08 Andrey O. Matveev

Let $S_{n}$ denote the set of permutations of $[n]=\{1,2,\dots, n\}$. For each integer $k\geq 1$, let $S_{n,k}$ be the set of all permutations of $[n]$ with exactly $k$ disjoint cycles. A subset $H\subseteq S_{n,k}$ is to be a matching if…

Combinatorics · Mathematics 2025-08-26 Cheng Yeaw Ku , Kok Bin Wong

For a circle map $f\colon\mathbb{S}\to\mathbb{S}$ with zero topological entropy, we show that a non-diagonal pair $\langle x,y\rangle\in \mathbb{S}\times \mathbb{S}$ is non-separable if and only if it is an IN-pair if and only if it is an…

Dynamical Systems · Mathematics 2021-07-07 Yini Yang

If $E=\{e_i\}$ and $F=\{f_i\}$ are two 1-unconditional basic sequences in $L_1$ with $E$ $r$-concave and $F$ $p$-convex, for some $1\le r<p\le 2$, then the space of matrices $\{a_{i,j}\}$ with norm $\|\{a_{i,j}\}\|_{E(F)}=\big\|\sum_k…

Functional Analysis · Mathematics 2013-03-20 Gideon Schechtman

The edges surrounding a face of a map $M$ form a cycle $C$, called the boundary cycle of the face, and $C$ is often not a simple cycle. If the map $M$ is arc-transitive, then there is a cyclic subgroup of automorphisms of $M$ which leaves…

Combinatorics · Mathematics 2021-11-05 Jiyong Chen , Cai Heng Li , Cheryl E. Praeger , Shu-Jiao Song

It is proved that there exists an absolute constant c > 0 such that for every natural number k, every non-bipartite 2-connected graph with average degree at least ck contains k cycles with consecutive odd lengths. This implies the existence…

Combinatorics · Mathematics 2014-10-03 Jie Ma