English
Related papers

Related papers: Cycles and 1-unconditional matrices

200 papers

Let $\cal M$ be a semi-finite von Neumann algebra equipped with a distinguished faithful, normal, semi-finite trace $\tau$. We introduce the notion of equi-integrability in non-commutative spaces and show that if a rearrangement invariant…

Functional Analysis · Mathematics 2007-05-23 Narcisse Randrianantoanina

For a fixed graph $F,$ the minimum number of edges in an edge-maximal $F$-free subgraph of $G$ is called the $F$-saturation number. The asymptotics of the $F$-saturation number of the binomial random graph $G(n,p)$ for constant $p\in(0,1)$…

Combinatorics · Mathematics 2022-03-11 Yury Demidovich , Arkadiy Skorkin , Maksim Zhukovskii

We propose geometrical methods for constructing square 01-matrices with the same number n of units in every row and column, and such that any two rows of the matrix contain at most one unit in common. These matrices are equivalent to…

Combinatorics · Mathematics 2009-10-01 Alexander A. Davydov , Massimo Giulietti , Stefano Marcugini , Fernanda Pambianco

Let $m, n$ be positive integers such that $m>1$ divides $n$. In this paper, we introduce a special class of piecewise-affine permutations of the finite set $[1, n]:=\{1, \ldots, n\}$ with the property that the reduction $\pmod m$ of $m$…

Number Theory · Mathematics 2020-03-13 Lucas Reis , Sávio Ribas

Let H be a 3-uniform hypergraph with N vertices. A tight Hamilton cycle C \subset H is a collection of N edges for which there is an ordering of the vertices v_1, ..., v_N such that every triple of consecutive vertices {v_i, v_{i+1},…

Combinatorics · Mathematics 2010-06-09 Alan Frieze , Michael Krivelevich , Po-Shen Loh

The graph of overlapping permutations is defined in a way analogous to the De Bruijn graph on strings of symbols. That is, for every permutation $\pi = \pi_{1} \pi_{2} ... \pi_{n+1}$ there is a directed edge from the standardization of…

Combinatorics · Mathematics 2014-10-08 Richard Ehrenborg , Sergey Kitaev , Einar Steingrimsson

We investigate a rearrangement inequality for pairs of n-square matrices: Let |A\|_p denote the C^p trace norm of an n-square matrix A. Consider the quantity |A+B|_p^p + |A-B|_p^p. Under certain positivity conditions, we show that this is…

Operator Algebras · Mathematics 2007-05-23 Eric Carlen , Elliott H. Lieb

The notion of p-competition graphs of digraphs was introduced by S-R. Kim, T. A. McKee, F. R. McMorris, and F. S. Roberts [p-competition graphs, Linear Algebra Appl., 217 (1995) 167--178] as a generalization of the competition graphs of…

Combinatorics · Mathematics 2010-06-01 Suh-Ryung Kim , Boram Park , Yoshio Sano

Let $A_p(\C)$ be the space of entire functions such that $| f(z)|\le Ae^{Bp(z)}$ for some $A,B>0$ and let $V$ be a discrete sequence of complex numbers which is not a uniqueness set for $A_p(\C)$. We use $L^2$ estimates for the…

Complex Variables · Mathematics 2008-01-22 Myriam Ounaies

In this work we study the null space of bipartite graphs without cycles of length multiple of $4$, and its relation to structural properties. We decompose them into two subgraphs: $C_N(G)$ and $C_S(G)$. $C_N(G)$ has perfect matching and its…

Combinatorics · Mathematics 2018-10-16 Daniel A. Jaume , Gonzalo Molina , Adrián Pastine

We show that the basis graph of an even delta-matroid is Hamiltonian if it has more than two vertices. More strongly, we prove that for two distinct edges $e$ and $f$ sharing a common end, it has a Hamiltonian cycle using $e$ and avoiding…

Combinatorics · Mathematics 2025-08-15 Donggyu Kim , Sang-il Oum

We show that algebraic equivalence of images of stable maps of curves lifts to deformation equivalence of the stable maps. The main applications concern $A_1(X)$, the group of 1-cycles modulo algebraic equivalence, for smooth, separably…

Algebraic Geometry · Mathematics 2023-02-15 János Kollár , Zhiyu Tian

We illustrate a physical situation in which topological symmetry, its breakdown, space-time uncertainty principle, and background independence may play an important role in constructing and understanding matrix models. First, we show that…

High Energy Physics - Theory · Physics 2015-06-26 Ichiro Oda

This paper describes the synthesis of matrices with good correlation, from cyclic shifts of pseudonoise columns. Optimum matrices result whenever the shift sequence satisfies the constant difference property. Known shift sequences with the…

Discrete Mathematics · Computer Science 2007-07-13 Andrew Z Tirkel , Tom E Hall

We characterize the sequences of fixed point indices $\{i(f^n, p)\}_{n\ge 1}$ of fixed points that are isolated as an invariant set and continuous maps in the plane. In particular, we prove that the sequence is periodic and $i(f^n, p) \le…

Dynamical Systems · Mathematics 2016-05-30 Luis Hernandez-Corbato , Francisco R. Ruiz del Portal

If ${\cal H}=(V,{\cal E})$ is a hypergraph, its edge intersection hypergraph $EI({\cal H})=(V,{\cal E}^{EI})$ has the edge set ${\cal E}^{EI}=\{e_1 \cap e_2 \ |\ e_1, e_2 \in {\cal E} \ \wedge \ e_1 \neq e_2 \ \wedge \ |e_1 \cap e_2 |\geq…

Combinatorics · Mathematics 2022-11-14 Sophie Pätz , Martin Sonntag

For fixed $k\ge 2$, determining the order of magnitude of the number of edges in an $n$-vertex bipartite graph not containing $C_{2k}$, the cycle of length $2k$, is a long-standing open problem. We consider an extension of this problem to…

Combinatorics · Mathematics 2024-02-21 Sayan Mukherjee

Let G be a finite group of exponent m and let k be a field of characteristic prime to m, containing the m-th roots of unity. For any Rost cycle module M over k, we construct exact sequences detecting the unramified elements in Serre's group…

Algebraic Geometry · Mathematics 2016-09-02 Bruno Kahn , Ngan Thi Kim Nguyen

In this article, we prove the equivalence of dynamical stability, preperiodicity, and canonical height 0, for algebraic families of rational maps $f_t: \mathbb{P}^1(\mathbb{C}) \to \mathbb{P}^1(\mathbb{C})$, parameterized by $t$ in a…

Dynamical Systems · Mathematics 2016-07-18 Laura DeMarco

The current paper is dedicated to the problem of finding the number of mutually non isomorphic bipartite graphs of the type $g=\langle R_g ,C_g ,E_g \rangle$ at given $n=|R_g |$ and $m=|C_g |$, where $R_g$ and $C_g$ are the two disjoint…

Discrete Mathematics · Computer Science 2016-04-12 Krasimir Yordzhev
‹ Prev 1 3 4 5 6 7 10 Next ›