English
Related papers

Related papers: Zero $A$-paths and the Erd\H{o}s-P\'osa property

200 papers

It is well-known that a finitely generated group $\Gamma$ has Kazhdan's property (T) if and only if the Laplacian element $\Delta$ in ${\mathbb R}[\Gamma]$ has a spectral gap. In this paper, we prove that this phenomenon is witnessed in…

Group Theory · Mathematics 2015-12-02 Narutaka Ozawa

The $G$-graph $\Gamma(G,S)$ is a graph from the group $G$ generated by $S\subseteq G$, where the vertices are the right cosets of the cyclic subgroups $\langle s \rangle, s\in S$ with $k$-edges between two distinct cosets if there is an…

Combinatorics · Mathematics 2016-09-05 Lord Clifford Kavi

Let $\Gamma=(G, \sigma)$ be a signed graph of order $n$ with underlying graph $G$ and a sign function $\sigma: E(G)\rightarrow \{+, -\}$. Denoted by $i_+(\Gamma)$, $\theta(\Gamma)$ and $p(\Gamma)$ the positive inertia index, the cyclomatic…

Spectral Theory · Mathematics 2025-07-01 Jie Pu , Fang Duan

We show how the robustness of gamma hedging can be understood without using rough-path theory. Instead, we use the concepts of $p^{th}$ variation along a partition sequence and Taylor's theorem directly, rather than defining an integral and…

Probability · Mathematics 2026-01-14 John Armstrong , Purba Das

A $\Gamma$\emph{-distance magic labeling} of a graph $G = (V, E)$ with $|V| = n$ is a bijection $\ell$ from $V$ to an Abelian group $\Gamma$ of order $n$, for which there exists $\mu \in \Gamma$, such that the weight $w(x) =\sum_{y\in…

Combinatorics · Mathematics 2025-12-30 Sylwia Cichacz , Štefko Miklavič

In this article we put a very elaborate PSH-like structure on the $R_{+}(-)$ groups of products of finite general linear groups. This is not the case we want. Firstly one would really want the actual big PSH algebra of products of general…

Number Theory · Mathematics 2022-01-05 Victor P Snaith

Let $\Gamma$ be an amenable countable discrete group. Fix an ergodic free nonsingular action of $\Gamma$ on a nonatomic standard probability space. Let $G$ be a compactly generated locally compact second countable group such that the…

Dynamical Systems · Mathematics 2019-09-04 Alexandre I. Danilenko

For an additive group $\Gamma$ the sequence $S = (g_1, \ldots, g_t)$ of elements of $\Gamma$ is a zero-sum sequence if $g_1 + \cdots + g_t = 0_\Gamma$. The cross number of $S$ is defined to be the sum $\sum_{i=1}^k 1/|g_i|$, where $|g_i|$…

Combinatorics · Mathematics 2024-05-29 Neal Bushaw , Glenn Hurlbert

The Barbero-Immirzi parameter $\gamma$ appears in the \emph{real} connection formulation of gravity in terms of the Ashtekar variables, and gives rise to a one-parameter quantization ambiguity in Loop Quantum Gravity. In this paper we…

General Relativity and Quantum Cosmology · Physics 2015-06-03 Tomas Liko

Let $G$ be a finite abelian group of exponent $n$, written additively, and let $A$ be a subset of $\mathbb{Z}$. The constant $s_A(G)$ is defined as the smallest integer $\ell$ such that any sequence over $G$ of length at least $\ell$ has an…

Number Theory · Mathematics 2019-06-13 Filipe Oliveira , Abílio Lemos , Hemar Godinho

We prove a modified version for a conjecture of Weiss from 2004. Let $G$ be a semisimple real algebraic group defined over $\mathbb{Q}$, $\Gamma$ be an arithmetic subgroup of $G$. A trajectory in $G/\Gamma$ is divergent if eventually it…

Dynamical Systems · Mathematics 2021-05-07 Nattalie Tamam

Given a finite group $G$, the \emph{Prime Order Element (POE) Graph} $\Gamma(G)$ consists of the group elements as the vertices, and two vertices $x$ and $y$ are adjacent if and only if $o(xy)$ is prime. This paper presents a thorough…

Combinatorics · Mathematics 2026-03-23 Tapa Manna , Supriyo Dutta , Baby Bhattacharya

Let $\overrightarrow{G}$ be a directed graph with no component of orderless than~$3$, and let $\Gamma$ be a finite Abelian group such that $|\Gamma|\geq 4|V(\overrightarrow{G})|$ or if $|V(\overrightarrow{G})|$ is large enough with respect…

Combinatorics · Mathematics 2022-01-24 Sylwia Cichacz , Zsolt Tuza

The classical Erd\H{o}s-P\'{o}sa theorem states that for each positive integer k there is an f(k) such that, in each graph G which does not have k+1 disjoint cycles, there is a blocker of size at most f(k); that is, a set B of at most f(k)…

Combinatorics · Mathematics 2012-10-11 Valentas Kurauskas , Colin McDiarmid

For any countable group $\Gamma$ satisfying the ``weak Rohlin property'', and for any dynamical property, the set of $\Gamma$-actions with that property is either residual or meager. The class of groups with the weak Rohlin property…

Dynamical Systems · Mathematics 2009-09-25 Eli Glasner , Jonathan King

We determine the extent to which the collection of $\Gamma$-Euler-Satake characteristics classify closed 2-orbifolds. In particular, we show that the closed, connected, effective, orientable 2-orbifolds are classified by the collection of…

Differential Geometry · Mathematics 2011-04-12 Whitney DuVal , John Schulte , Christopher Seaton , Bradford Taylor

In this paper, we present an overview of some of the existing issues of the research in quantum gravity. We also introduce the basic ideas that led Padmanabhan to consider a duality property in path integrals. Such a duality is consistent…

High Energy Physics - Theory · Physics 2022-09-22 Piero Nicolini

Let $G$ be a directed graph on finitely many vertices and edges, and assign a positive weight to each edge on $G$. Fix vertices $u$ and $v$ and consider the set of paths that start at $u$ and end at $v$, self-intersecting in any number of…

Probability · Mathematics 2013-06-13 R. Edwards , E. Foxall , T. J. Perkins

We prove that for any circle graph $H$ with at least one edge and for any positive integer $k$, there exists an integer $t=t(k,H)$ so that every graph $G$ either has a vertex-minor isomorphic to the disjoint union of $k$ copies of $H$, or…

The prism over a graph $G$ is the cartesian product $G \Box K_2$. It is known that the property of having a Hamiltonian prism (prism-Hamiltonicity) is stronger than that of having a $2$-walk (spanning closed walk using every vertex at most…

Combinatorics · Mathematics 2018-12-10 M. N. Ellingham , Pouria Salehi Nowbandegani
‹ Prev 1 4 5 6 7 8 10 Next ›