English
Related papers

Related papers: An integral weight realization theorem for subset …

200 papers

We show that every effectively closed action of a finitely generated group $G$ on a closed subset of $\{0,1\}^{\mathbb{N}}$ can be obtained as a topological factor of the $G$-subaction of a $(G \times H_1 \times H_2)$-subshift of finite…

Dynamical Systems · Mathematics 2020-05-07 Sebastián Barbieri

We show that the membership problem in a finitely generated submonoid of a graph group (also called a right-angled Artin group or a free partially commutative group) is decidable if and only if the independence graph (commutation graph) is…

Group Theory · Mathematics 2007-07-19 Markus Lohrey , Benjamin Steinberg

For a graph $G$, let $\nu_s(G)$ be the induced matching number of $G$. We prove that $\nu_s(G) \geq \frac{n(G)}{(\lceil\frac{\Delta}{2}\rceil+1) (\lfloor\frac{\Delta}{2}\rfloor+1)}$ for every graph of sufficiently large maximum degree…

Combinatorics · Mathematics 2014-06-11 Felix Joos

The goal of this paper is to study Goldbach's conjecture for rings of regular functions of affine algebraic varieties over a field. Among our main results, we define the notion of Goldbach condition for Newton polytopes, and we prove in a…

Number Theory · Mathematics 2023-12-29 Alberto F. Boix , Danny A. J. Gómez-Ramírez

Let $G$ be a finite group and let $N$ be a normal subgroup of $G$. We attach to $N$ two graphs ${\Gamma}_G(N)$ and ${\Gamma}^{\ast}_G(N)$ related to the conjugacy classes of $G$ contained in $N$ and to the set of primes dividing the sizes…

Group Theory · Mathematics 2024-02-12 Antonio Beltrán , María José Felipe , Carmen Melchor

Let $\Gamma$ be a group and $r_n(\Gamma)$ the number of its $n$-dimensional irreducible complex representations. We define and study the associated representation zeta function $\calz_\Gamma(s) = \suml^\infty_{n=1} r_n(\Gamma)n^{-s}$. When…

Group Theory · Mathematics 2008-05-06 M. Larsen , A. Lubotzky

A measure preserving action of a countably infinite group \Gamma is called totally ergodic if every infinite subgroup of \Gamma acts ergodically. For example, all mixing and mildly mixing actions are totally ergodic. This note shows that if…

Dynamical Systems · Mathematics 2012-08-06 Robin Tucker-Drob

We study classes of countable graphs where every member does not contain a given finite graph as an induced subgraph -- denoted by $\mathsf{Free}(\mathcal{G})$ for a given finite graph $\mathcal{G}$. Our main results establish a structural…

A simple graph $G$ is an {\it 2-tree} if $G=K_3$, or $G$ has a vertex $v$ of degree 2, whose neighbors are adjacent, and $G-v$ is an 2-tree. Clearly, if $G$ is an 2-tree on $n$ vertices, then $|E(G)|=2n-3$. A non-increasing sequence…

Combinatorics · Mathematics 2018-07-03 De-Yan Zeng , Dong-Yang Zhai , Jian-Hua Yin

Let $\mu$ be a measure on $SL_{2}(\mathbb{R})$ generating a non-compact and totally irreducible subgroup, let $\chi>0$ denote its Lyapunov exponent, and let $\nu$ be the associated stationary (Furstenberg) measure for the action on the…

Dynamical Systems · Mathematics 2017-08-25 Michael Hochman , Boris Solomyak

A theorem of Frieze from 1985 asserts that the total weight of the minimum spanning tree of the complete graph $K_n$ whose edges get independent weights from the distribution $UNIFORM[0,1]$ converges to Ap\'ery's constant in probability, as…

Combinatorics · Mathematics 2025-04-14 Jan Hladký , Gopal Viswanathan

A subset $\Sigma \subset F_N$ of the free group of rank $N$ is called \emph{spectrally rigid} if whenever trees $T, T'$ in Culler-Vogtmann Outer Space are such that $\| g \|_T = \| g \|_{T'}$ for every $g \in \Sigma$, it follows that $T =…

Group Theory · Mathematics 2014-01-10 Brian Ray

Let k >= 2 and F be a linear k-uniform hypergraph with v vertices. We prove that if n is sufficiently large and v|n, then every quasirandom k-uniform hypergraph on n vertices with constant edge density and minimum degree $\Omega(n^{k-1})$…

Combinatorics · Mathematics 2014-02-18 John Lenz , Dhruv Mubayi

Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H in F is contained in G as a subgraph. The construction of sparse universal graphs for various families F has received a considerable amount of…

Combinatorics · Mathematics 2011-08-24 Daniel Johannsen , Michael Krivelevich , Wojciech Samotij

Let $\S$ be a commutative semigroup with identity $e$ and let $\Gamma$ be a compact subset in the pointwise convergence topology of the space $\S'$ of all non-zero multiplicative functions on $\S.$ Given a continuous function $F: \Gamma \to…

Complex Variables · Mathematics 2018-10-24 El Hassan Youssfi

We show that four-dimensional $\mathcal N=1$ effective theories of gravity obtained from string compactifications require a non-perturbative completion, as additional light states of non-perturbative origin must be incorporated in the small…

High Energy Physics - Theory · Physics 2026-05-29 Gonzalo F. Casas , Max Wiesner

Let $G$ be a finitely presented group that can be written as an extension \[ 1 \longrightarrow K \longrightarrow G \longrightarrow F_2 \longrightarrow 1 \] where $K$ is either the finitely generated free group $F_n$, $n > 2$ or the…

Geometric Topology · Mathematics 2020-05-06 Stefano Vidussi

Let A be the algebra generated by the power series \sum n^{n-1} q^n/n! and \sum n^n q^n /n! . We prove that many natural generating functions lie in this algebra: those appearing in graph enumeration problems, in the intersection theory of…

Algebraic Geometry · Mathematics 2016-09-07 Dimitri Zvonkine

We extend the notion of the compressed zero-divisor graph $\varTheta(R)$ to noncommutative rings in a way that still induces a product preserving functor $\varTheta$ from the category of finite unital rings to the category of directed…

Rings and Algebras · Mathematics 2023-08-28 Alen Đurić , Sara Jevđenić , Nik Stopar

We show that there exists a graph $G$ with $O(n)$ nodes, where any forest of $n$ nodes is a node-induced subgraph of $G$. Furthermore, for constant arboricity $k$, the result implies the existence of a graph with $O(n^k)$ nodes that…

Data Structures and Algorithms · Computer Science 2016-02-17 Stephen Alstrup , Søren Dahlgaard , Mathias Bæk Tejs Knudsen
‹ Prev 1 3 4 5 6 7 10 Next ›