English
Related papers

Related papers: A bridge between U-frequent hypercyclicity and fre…

200 papers

We study the densest subgraph problem and give algorithms via multiplicative weights update and area convexity that converge in $O\left(\frac{\log m}{\epsilon^{2}}\right)$ and $O\left(\frac{\log m}{\epsilon}\right)$ iterations,…

Data Structures and Algorithms · Computer Science 2024-06-18 Ta Duy Nguyen , Alina Ene

In 1988, Sibe Marde\v{s}i\'{c} and Andrei Prasolov isolated an inverse system $\mathbf{A}$ with the property that the additivity of strong homology on any class of spaces which includes the closed subsets of Euclidean space would entail…

Logic · Mathematics 2021-07-01 Jeffrey Bergfalk , Chris Lambie-Hanson

Let $\mathbf{A}$ be a bounded self-adjoint operator on a separable Hilbert space $\mathfrak{H}$ and $\mathfrak{H}_0\subset\mathfrak{H}$ a closed invariant subspace of $\mathbf{A}$. Assuming that $\mathfrak{H}_0$ is of codimension 1, we…

Spectral Theory · Mathematics 2007-05-23 Vadim Kostrykin , Konstantin A. Makarov

Let $U$ be a unitary operator acting on the Hilbert space H, and $\alpha:\{1,..., m\}\mapsto\{1,..., k\}$ a partition of the set $\{1,..., m\}$. We show that the ergodic average $$ \frac{1}{N^{k}}\sum_{n_{1},...,n_{k}=0}^{N-1}…

Functional Analysis · Mathematics 2007-05-23 francesco fidaleo

Certain operator algebras A on a Hilbert space have the property that every densely defined linear transformation commuting with A is closable. Such algebras are said to have the closability property. They are important in the study of the…

Functional Analysis · Mathematics 2009-08-10 H. Bercovici , R. G. Douglas , C. Foias , C. Pearcy

Set systems with strongly restricted intersections, called $\alpha$-intersecting families for a vector $\alpha$, were introduced recently as a generalization of several well-studied intersecting families including the classical oddtown and…

Combinatorics · Mathematics 2024-04-15 Xin Wei , Xiande Zhang , Gennian Ge

The entangled ergodic theorem concerns the study of the convergence in the strong, or merely weak operator topology, of the multiple Cesaro mean $$\frac{1}{N^{k}}\sum_{n_{1},...,n_{k}=0}^{N-1} U^{n_{\a(1)}}A_{1}U^{n_{\a(2)}}...…

Operator Algebras · Mathematics 2007-05-23 Francesco Fidaleo

We study properties of random subcomplexes of partitions returned by (a suitable form of) the Strong Hypergraph Regularity Lemma, which we call regular slices. We argue that these subcomplexes capture many important structural properties of…

Combinatorics · Mathematics 2014-11-19 Peter Allen , Julia Böttcher , Oliver Cooley , Richard Mycroft

A classical enumerative result states that, given a graph $G$ and a vertex $u$, the number of connected subgraphs of $G$ is equal to the number of orientations of $G$ such that every vertex can reach $u$ by a directed path. We show that…

Combinatorics · Mathematics 2026-05-18 Oliver Bernardi , Jonathan J. Fang

Action convergence provides a limit theory for linear bounded operators $A_n:L^{\infty}(\Omega_n)\longrightarrow L^1(\Omega_n)$ where $\Omega_n$ are potentially different probability spaces. This notion of convergence emerged in graph…

Combinatorics · Mathematics 2025-01-24 Giulio Zucal

We give a simple, straightforward proof of the non-hypercyclicity of an arbitrary (bounded or not) normal operator $A$ in a complex Hilbert space as well as of the collection $\left\{e^{tA}\right\}_{t\ge 0}$ of its exponentials, which,…

Functional Analysis · Mathematics 2019-09-30 Marat V. Markin , Edward S. Sichel

We prove that every complete non-compact manifold of finite volume contains a (possibly non-compact) minimal hypersurface of finite volume. The main tool is the following result of independent interest: if a region $U$ can be swept out by a…

Differential Geometry · Mathematics 2019-08-27 Gregory R. Chambers , Yevgeny Liokumovich

In this paper we present tight lower-bounds and new upper-bounds for hypergraph and database problems. We give tight lower-bounds for finding minimum hypercycles. We give tight lower-bounds for a substantial regime of unweighted hypercycle.…

Computational Complexity · Computer Science 2025-04-29 Cheng-Hao Fu , Andrea Lincoln , Rene Reyes

In this paper, we show that if the direct sum $T\oplus T$ of frequently hypercyclic operators is frequently hypercyclic, then every higher direct sum $T\oplus\cdots\oplus T$ is also frequently hypercyclic.

Functional Analysis · Mathematics 2014-08-22 Eunsang Kim , Tae Ryong Park

A criterion to obtain frequent hypercyclicity for a sequence of convolution operators on the space of entire functions on the complex plane is provided. The criterion involves that the generating functions of the operators do not vanish on…

Complex Variables · Mathematics 2026-02-24 L. Bernal-González , M. C. Calderón-Moreno , J. A. Prado-Bassas

In this paper we solve the problem of finding in a given weighted hypergraph a subhypergraph with a maximum possible density. We introduce the notion of a support matrix and prove that the density of an optimal subhypergraph is equal to…

Combinatorics · Mathematics 2023-05-09 Yuly Billig

Spinner mixtures consisting of both clockwise and counterclockwise self-spinning particles are often expected to phase separate. However, we demonstrate that such a demixing is absent for dimer (or rod-like) spinners. These particles always…

Soft Condensed Matter · Physics 2025-04-25 Rui Liu , Mingcheng Yang , Ke Chen

Let $\PP^d$ be the $d$-fold direct product of the set of primes. We prove that if $A$ is a subset of $\PP^d$ of positive relative upper density then $A$ contains infinitely many "corners", that is sets of the form $\{x,x+te_1,...,x+te_d\}$…

Number Theory · Mathematics 2013-06-14 Ákos Magyar , Tatchai Titichetrakun

We first generalize the results of Le\'on and M\"uller [Studia Math. 175(1) 2006] on hypercyclic subspaces to sequences of operators on Fr\'echet spaces with a continuous norm. Then we study the particular case of iterates of an operator T…

Functional Analysis · Mathematics 2014-02-20 Quentin Menet

A graph $G$ is $\textit{universal}$ for a (finite) family $\mathcal{H}$ of graphs if every $H \in \mathcal{H}$ is a subgraph of $G$. For a given family $\mathcal{H}$, the goal is to determine the smallest number of edges an…

Combinatorics · Mathematics 2024-01-12 Noga Alon , Natalie Dodson , Carmen Jackson , Rose McCarty , Rajko Nenadov , Lani Southern