English
Related papers

Related papers: Counting subgraphs in fftp graphs with symmetry

200 papers

We prove the quasimodularity of generating functions for counting torus covers, with and without Siegel-Veech weight. Our proof is based on analyzing decompositions of flat surfaces into horizontal cylinders. The quasimodularity arise as…

Geometric Topology · Mathematics 2017-04-21 Elise Goujard , Martin Moeller

We obtain many results and solve some problems about feebly compact paratopological groups. We obtain necessary and sufficient conditions for such a group to be topological. One of them is the quasiregularity. We prove that each…

Group Theory · Mathematics 2020-08-05 Taras Banakh , Alex Ravsky

This paper is an exploration of the faithful transitive permutation representations of the orientation-preserving automorphisms groups of highly symmetric toroidal maps and hypermaps. The main theorems of this paper give a list of all…

Group Theory · Mathematics 2023-09-01 Maria Elisa Fernandes , Claudio Alexandre Piedade

We use the theory of graph limits to study several quasi-random properties, mainly dealing with various versions of hereditary subgraph counts. The main idea is to transfer the properties of (sequences of) graphs to properties of graphons,…

Combinatorics · Mathematics 2009-05-21 Svante Janson

We study the automorphisms \phi of a finitely generated free group F. Building on the train-track technology of Bestvina, Feighn and Handel, we provide a topological representative f:G\to G of a power of \phi that behaves very much like the…

Group Theory · Mathematics 2007-05-23 Martin R. Bridson , Daniel Groves

This work considers new entropy-based proofs of some known, or otherwise refined, combinatorial bounds for bipartite graphs. These include upper bounds on the number of the independent sets, lower bounds on the minimal number of colors in…

Information Theory · Computer Science 2021-06-15 Igal Sason

We study the Travelling Salesperson (TSP) and the Steiner Tree problem (STP) in graphs of low highway dimension. This graph parameter was introduced by Abraham et al. [SODA 2010] as a model for transportation networks, on which TSP and STP…

Data Structures and Algorithms · Computer Science 2019-07-15 Yann Disser , Andreas Emil Feldmann , Max Klimm , Jochen Konemann

We prove that commutator subgroups of topological full groups arising from minimal subshifts have exponential growth. We also prove that the measurable full group associated to the countable, measure-preserving, ergodic and hyperfinite…

Dynamical Systems · Mathematics 2012-04-03 Hiroki Matui

We prove an extension of the Furstenberg set theorem to families of graphs satisfying a transversality condition. We apply the result to derive bounds on $L^{p}$-norms of Fourier transforms of fractal measures supported on plane curves.

Classical Analysis and ODEs · Mathematics 2025-08-27 Tuomas Orponen , Aleksi Pyörälä , Guangzeng Yi

In this paper we study variations of an old result by M\"{u}ller, Reiterman, and the last author stating that a countable graph has a subgraph with infinite degrees if and only if in any labeling of the vertices (or edges) of this graph by…

Combinatorics · Mathematics 2019-05-10 Andrii Arman , Bradley Elliott , Vojtěch Rödl

We study the question whether the affine semigroup of integer points in a convex cone can be finitely generated up to symmetries of the cone. We establish general properties of finite generation up to symmetry, and then concentrate on the…

Number Theory · Mathematics 2025-04-23 Grigoriy Blekherman , Jesús A. De Loera , Luze Xu , Shixuan Zhang

We determine the factorial growth rate of the number of finite index subgroups of right-angled Artin groups as a function of the index. This turns out to depend solely on the independence number of the defining graph. We also make a…

Group Theory · Mathematics 2019-09-11 Hyungryul Baik , Bram Petri , Jean Raimbault

We investigate the enhancement of graph neural networks' (GNNs) representation power through their ability in substructure counting. Recent advances have seen the adoption of subgraph GNNs, which partition an input graph into numerous…

Machine Learning · Computer Science 2024-06-14 Zuoyu Yan , Junru Zhou , Liangcai Gao , Zhi Tang , Muhan Zhang

We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main…

Dynamical Systems · Mathematics 2020-09-14 Ville Salo

We present a general approach to proving the existence of spectral gaps and asynchronous exponential growth for growth-fragmentation semigroups in moment spaces $L^{1}(\mathbb{R}_{+};\ x^{\alpha }dx)$ and $L^{1}(\mathbb{R} _{+};\ \left(…

Functional Analysis · Mathematics 2022-01-14 Mustapha Mokhtar-Kharroubi , Jacek Banasiak

Finding the number of maximal subgroups of infinite index of a finitely generated group is a natural problem that has been solved for several classes of `geometric' groups (linear groups, hyperbolic groups, mapping class groups, etc). Here…

Group Theory · Mathematics 2024-08-28 Dominik Francoeur , Alejandra Garrido

We introduce fractional realizations of a graph degree sequence and a closely associated convex polytope. Simple graph realizations correspond to a subset of the vertices of this polytope. We describe properties of the polytope vertices and…

Combinatorics · Mathematics 2015-08-04 Michael D. Barrus

We prove that if F is a finitely generated free group and f:F -> F is an automorphism with polynomial growth of degree d, then there exists a characteristic subgroup S < F of finite index such that the induced automorphism of the…

Group Theory · Mathematics 2007-05-23 Adam Piggott

A cornerstone of extremal graph theory due to Erd\H{o}s and Stone states that the edge density which guarantees a fixed graph $F$ as subgraph also asymptotically guarantees a blow-up of $F$ as subgraph. It is natural to ask whether this…

Combinatorics · Mathematics 2026-04-01 Richard Lang , Nicolás Sanhueza-Matamala

We determine a lower gap property for the growth of an unbounded \(\mathbb{Z}\)-valued \(k\)-regular sequence. In particular, if \(f:\mathbb{N}\to\mathbb{Z}\) is an unbounded \(k\)-regular sequence, we show that there is a constant \(c>0\)…

Number Theory · Mathematics 2014-10-22 Jason P. Bell , Michael Coons , Kevin G. Hare