English
Related papers

Related papers: Minimal relations and catenary degrees in Krull mo…

200 papers

The minimal faithful permutation degree $\mu(G)$ of a finite group $G$ is the least nonnegative integer $n$ such that $G$ embeds in the symmetric group $\Sym(n)$. We prove that if $H$ is a group then $\mu(G)=\mu(G\times H)$ for some group…

Group Theory · Mathematics 2017-01-23 David Easdown , Michael Hendriksen , Neil Saunders

For a given multigraph H, a graph G is H-linked, if |G| \geq |H| and for every injective map {\tau}: V (H) \rightarrow V (G), we can find internally disjoint paths in G, such that every edge from uv in H corresponds to a {\tau} (u) - {\tau}…

Combinatorics · Mathematics 2012-06-08 Florian Pfender

We study the minimal homogeneous generating sets of the Eulerian ideal associated with a simple graph and its maximal generating degree. We show that the Eulerian ideal is a lattice ideal and use this to give a characterization of binomials…

Commutative Algebra · Mathematics 2024-05-24 Jorge Neves , Gonçalo Varejão

Suppose that $k\geq 2$ and $A$ is a non-empty subset of a finite abelian group $G$ with $|G|>1$. Then the cardinality of the restricted sumset $$ k^\wedge A:=\{a_1+\cdots+a_k:\,a_1,\ldots,a_k\in A,\ a_i\neq a_j\text{ for }i\neq j\} $$ is at…

Combinatorics · Mathematics 2024-03-07 Shanshan Du , Hao Pan

For a finite abelian group $G$ and a positive integer $k$, let $\mathsf{D}_k(G)$ denote the smallest integer $\ell$ such that each sequence over $G$ of length at least $\ell$ has $k$ disjoint nontrivial zero-sum subsequences. It is known…

Combinatorics · Mathematics 2025-03-28 Qinghai Zhong

Let $G$ be a connected, simply connected, simple, complex, linear algebraic group. Let $P$ be an arbitrary parabolic subgroup of $G$. Let $X=G/P$ be the $G$-homogeneous projective space attached to this situation. We consider the (small)…

Algebraic Geometry · Mathematics 2016-12-14 Christoph Bärligea

Let $D$ be a strongly connected directed graph of order $n\geq 4$ which satisfies the following condition (*): for every pair of non-adjacent vertices $x, y$ with a common in-neighbour $d(x)+d(y)\geq 2n-1$ and $min \{ d(x), d(y)\}\geq n-1$.…

Combinatorics · Mathematics 2014-04-24 Samvel Kh. Darbinyan , Iskandar A. Karapetyan

Let $G$ be a finite group of order $n$, and denote by $\rho(G)$ the product of element orders of $G$. The aim of this work is to provide some upper bounds for $\rho(G)$ depending only on $n$ and on its least prime divisor, when $G$ belongs…

Group Theory · Mathematics 2023-01-12 Elena Di Domenico , Carmine Monetta , Marialaura Noce

Let $M$ be a $\rm II_1$ factor and let $\mathcal{F}(M)$ denote the fundamental group of $M$. In this article, we study the following property of $M$: for arbitrary $\rm II_1$ factor $B$, we have $\mathcal{F}(M \overline{\otimes}…

Operator Algebras · Mathematics 2019-02-05 Yusuke Isono

Let G be an infinite group and let h and g be elements. We say that h is a root of g if some integer power of h is equal to g. We define K(G) to be the subgroup of all elements of G for which the number of elements which are not roots is of…

Combinatorics · Mathematics 2011-12-30 Vance Faber

Let $G$ and $H$ be graphs. We say that $P$ is an $H$-packing of $G$ if $P$ is a set of edge-disjoint copies of $H$ in $G$. An $H$-packing $P$ is maximal if there is no other $H$-packing of $G$ that properly contains $P$. Packings of maximum…

Combinatorics · Mathematics 2018-07-16 Maria Axenovich , Anika Kaufmann , Raphael Yuster

A graph of order $n$ is said to be $k$-\emph{factor-critical} $(0\le k<n)$ if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$-factor-critical graph $G$ is \emph{minimal} if $G-e$ is not $k$-factor-critical…

Combinatorics · Mathematics 2026-03-12 Kevin Pereyra

Let $G$ be a finite group written multiplicatively. By a sequence over $G$, we mean a finite sequence of terms from $G$ which is unordered, repetition of terms allowed, and we say that it is a product-one sequence if its terms can be…

Number Theory · Mathematics 2012-11-13 A. Geroldinger , D. J. Grynkiewicz

We consider the Carnot-Carath\'eodory distance $\delta_E$ to a closed set $E$ in the sub-Riemannian Heisenberg groups $\mathbb{H}^n$, $n\ge 1$. The $\mathbb{H}$-regularity of $\delta_E$ is proved under mild conditions involving a general…

Metric Geometry · Mathematics 2017-11-13 Manuel Ritoré

This is an expository paper in which it is proved that, for every infinite field ${\mathbf{F}}$, the polynomial ring ${\mathbf{F}}[t_1,\ldots, t_n]$ has Krull dimension $n$. The proof uses only "high school algebra" and the rudiments of…

Commutative Algebra · Mathematics 2019-10-01 Melvyn B. Nathanson

In the present work, we prove that every class of the divisor class group of a Krull monoid algebra contains infinitely many prime divisors. Several attempts to this result have been made in the literature so far, unfortunately with open…

Commutative Algebra · Mathematics 2021-01-13 Victor Fadinger , Daniel Windisch

That is, given a compact set $B \subset \mathbb{R}^n$ (the boundary) and a subgroup $L$ of the \v{C}ech homology group $\check{H}_{d-1}(B;G)$ of dimension $d$ over some commutative group $G$, we find a compact set $E \supset B$ such that…

Classical Analysis and ODEs · Mathematics 2014-01-23 Yangqin Fang

A seminal result of Hajnal and Szemer\'{e}di states that if a graph $G$ with $n$ vertices has minimum degree $\delta(G) \ge (r-1)n/r$ for some integer $r \ge 2$, then $G$ contains a $K_r$-factor, assuming $r$ divides $n$. Extremal examples…

Combinatorics · Mathematics 2018-06-20 Rajko Nenadov , Yanitsa Pehova

Given any pair of countable groups $G$ and $H$ with $G$ infinite, we construct a minimal, free, Cantor $G$-flow $X$ so that $H$ embeds into the group of automorphisms of $X$.

Dynamical Systems · Mathematics 2023-06-22 Andy Zucker

The Harborth constant of a finite group $G$ is the smallest integer $k\geq \exp(G)$ such that any subset of $G$ of size $k$ contains $\exp(G)$ distinct elements whose product is $1$. Generalizing previous work on the Harborth constants of…

Combinatorics · Mathematics 2018-07-16 Noah Kravitz