English
Related papers

Related papers: Uniform Bounds on Pre-Images under Quadratic Dynam…

200 papers

An upper bound on degrees of elements of a minimal generating system for invariants of quivers of dimension (2,...,2) is established over a field of arbitrary characteristic and its precision is estimated. The proof is based on the…

Combinatorics · Mathematics 2012-04-26 A. A. Lopatin

We show that if $K$ is a monogenic, primitive, totally real number field, that contains units of every signature, then there exists a lower bound for the rank of integer universal quadratic forms defined over $K$. In particular, we extend…

Number Theory · Mathematics 2018-08-07 Pavlo Yatsyna

Let $G$ be a finite abelian group and $A$ be a subset of $G \times G$ which is corner--free, meaning that there are no $x, y \in G$ and $d \in G \setminus \{0\}$ such that $(x, y)$, $(x+d, y)$, $(x, y+d) \in A$. We prove that \[|A| \le…

Combinatorics · Mathematics 2025-07-15 Michael Jaber , Yang P. Liu , Shachar Lovett , Anthony Ostuni , Mehtaab Sawhney

For a maximal outerplanar graph $G$ of order $n$ at least $3$, Matheson and Tarjan showed that $G$ has domination number at most $n/3$. Similarly, for a maximal outerplanar graph $G$ of order $n$ at least $5$, Dorfling, Hattingh, and Jonck…

Combinatorics · Mathematics 2015-11-30 José D. Alvarado , Simone Dantas , Dieter Rautenbach

The main result of this paper is a sharp upper bound on the first positive eigenvalue of Dirac operators in two dimensional simply connected $C^3$-domains with infinite mass boundary conditions. This bound is given in terms of a conformal…

Spectral Theory · Mathematics 2019-05-01 Vladimir Lotoreichik , Thomas Ourmières-Bonafos

Let $K$ be a number field, let $S$ be a finite set of places of $K$, and let $R_S$ be the ring of $S$-integers of $K$. A $K$-morphism $f:\mathbb{P}^1_K\to\mathbb{P}^1_K$ has simple good reduction outside $S$ if it extends to an…

Number Theory · Mathematics 2018-03-28 Joseph H. Silverman

The 3-uniform tight cycle $C_s^3$ has vertex set $ Z_s$ and edge set $\{\{i, i+1, i+2\}: i \in Z_s\}$. We prove that for every $s \not\equiv 0$ (mod 3) and $s \ge 16$ or $s \in \{8,11,14\}$ there is a $c_s>0$ such that the 3-uniform…

Combinatorics · Mathematics 2016-08-10 Dhruv Mubayi

Not every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyond planarity by considering upward $k$-planar drawings of…

In this paper, we obtain two spectral upper bounds for the $k$-independence number of a graph which is is the maximum size of a set of vertices at pairwise distance greater than $k$. We construct graphs that attain equality for our first…

Combinatorics · Mathematics 2016-08-19 Aida Abiad , Sebastian Cioabă , Michael Tait

Let phi be a morphism of projective N-space defined over a number field K. We prove that there is a bound B depending only on phi such that every twist of phi has no more than B K-rational preperiodic points. (This result is analagous to a…

Number Theory · Mathematics 2012-05-10 Alon Levy , Michelle Manes , Bianca Thompson

We prove a new upper bound for diagonal two-colour Ramsey numbers, showing that there exists a constant $C$ such that \[r(k+1, k+1) \leq k^{- C \frac{\log k}{\log \log k}} \binom{2k}{k}.\]

Combinatorics · Mathematics 2007-05-23 David Conlon

The bondage number b(G) of a graph G is the smallest number of edges of G whose removal from G results in a graph having the domination number larger than that of G. We show that, for a graph G having the maximum vertex degree $\Delta(G)$…

Combinatorics · Mathematics 2016-04-25 Andrei Gagarin , Vadim Zverovich

The bend-number b(G) of a graph G is the minimum k such that G may be represented as the edge intersection graph of a set of grid paths with at most k bends. We confirm a conjecture of Biedl and Stern showing that the maximum bend-number of…

Combinatorics · Mathematics 2011-12-16 Daniel Heldt , Kolja Knauer , Torsten Ueckerdt

We show an improved upper estimate for van der Waerden number $W(3,k):$ there is an absolute constant $c>0$ such that if $\{1,\dots,N\}=X\cup Y$ is a partition such that $X$ does not contain any arithmetic progression of length $3$ and $Y$…

Combinatorics · Mathematics 2020-06-05 Tomasz Schoen

The bondage number $b(G)$ of a graph $G$ is the smallest number of edges whose removal from $G$ results in a graph with larger domination number. Recently Gagarin and Zverovich showed that, for a graph $G$ with maximum degree $\Delta(G)$…

Combinatorics · Mathematics 2012-10-26 Jia Huang

In [P. Niroomand, R. Rezaei, On the exterior degree of finite groups, Comm. Algebra 39 (2011), 335-343] it is introduced a group invariant, related to the number of elements $x$ and $y$ of a finite group $G$, such that $x \wedge y = 1_{G…

K-Theory and Homology · Mathematics 2018-12-14 Peyman Niroomand , Rashid Rezaei , Francesco G. Russo

Let $H$ and $F$ be hypergraphs. We say $H$ contains $F$ as a trace if there exists some set $S \subseteq V(H)$ such that $H|_S:=\{E\cap S: E \in E(H)\}$ contains a subhypergraph isomorphic to $F$. In this paper we give an upper bound on the…

Combinatorics · Mathematics 2020-07-08 Ruth Luo , Sam Spiro

First we find effective bounds for the number of dominant rational maps $f:X \rightarrow Y$ between two fixed smooth projective varieties with ample canonical bundles. The bounds are of the type $\{A \cdot K_X^n\}^{\{B \cdot K_X^n\}^2}$,…

alg-geom · Mathematics 2014-12-01 T. Bandman , G. Dethloff

Let $k$ be a positive integer and let $G$ be a graph with vertex set $V(G)$. A subset $D \subseteq V(G)$ is a $k$-dominating set if every vertex outside $D$ is adjacent to at least $k$ vertices in $D$. The $k$-domination number…

Combinatorics · Mathematics 2020-05-27 Gülnaz Boruzanlı Ekinci , Csilla Bujtás

We obtain some new upper bounds on the Ramsey numbers of the form $R(\underbrace{C_4,\ldots,C_4}_m,G_1,\ldots,G_n)$, where $m\ge 1$ and $G_1,\ldots,G_n$ are arbitrary graphs. We focus on the cases of $G_i$'s being complete, star $K_{1,k}$…

Combinatorics · Mathematics 2023-11-23 Luis Boza , Stanisław Radziszowski