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

Let $V,W$ be representations of a cyclic group $G$ of prime order $p$ over a field $k$ of characteristic $p$. The module of covariants $k[V,W]^G$ is the set of $G$-equivariant polynomial maps $V \rightarrow W$, and is a module over…

We extend an earlier result by Dan Abramovich, showing that a conjecture of S. Lang's implies the existence of a uniform bound on the number of $K$-rational points over all smooth curves of genus $g$ defined over $K$, where $K$ is any…

We give an upper bound on the number of perfect matchings in an undirected simple graph $G$ with an even number of vertices, in terms of the degrees of all the vertices in $G$. This bound is sharp if $G$ is a union of complete bipartite…

A common problem to all applications of linear finite dynamical systems is analyzing the dynamics without enumerating every possible state transition. Of particular interest is the long term dynamical behaviour. In this paper, we study the…

For a simple algebraic group G in characteristic p, a triple (a,b,c) of positive integers is said to be rigid for G if the dimensions of the subvarieties of G of elements of order dividing a,b,c sum to 2dim G. In this paper we complete the…

It is proved that for any finite dimensional representation of a prime order group over the field of rational numbers, polynomial invariants of degree at most $3$ separate the orbits. A result providing an upper degree bound for separating…

We establish uniform bounds on the multiplicities of irreducible admissible representations appearing in spaces of functions on symmetric spaces over $p$-adic fields. These multiplicities can exceed one and depend intricately on the group,…

Given a graph $G=\big{(}V(G),E(G)\big{)}$, a set $S\subseteq V(G)$ is called a $k$-dominating set if every vertex in $V(G)\setminus S$ has at least $k$ neighbors in $S$. Two disjoint sets $A,B\subset V(G)$ form a $k$-coalition in $G$ if…

For each $k\geq 3$, Green proved an arithmetic $k$-cycle removal lemma for any abelian group $G$. The best known bounds relating the parameters in the lemma for general $G$ are of tower-type. For $k>3$, even in the case $G=\mathbb{F}_2^n$…

By relating the number of images of a function with finite domain to a certain parameter, we obtain both an upper and lower bound for the image set. Even though the arguments are elementary, the bounds are, in some sense, best possible. The…

Let $G$ be a finite group, and let ${\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. The degree graph $\Delta(G)$ of $G$ is defined as the simple undirected graph whose vertex set ${\rm{V}}(G)$ consists…

For $s \ge 4$, the 3-uniform tight cycle $C^3_s$ has vertex set corresponding to $s$ distinct points on a circle and edge set given by the $s$ cyclic intervals of three consecutive points. For fixed $s \ge 4$ and $s \not\equiv 0$ (mod 3) we…

We study the maximum number of hyperedges in a 3-uniform hypergraph on $n$ vertices that does not contain a Berge cycle of a given length $\ell$. In particular we prove that the upper bound for $C_{2k+1}$-free hypergraphs is of the order…

Let $K$ be a function field of characteristic $p\geq0$ or a number field over which the $abc$ conjecture holds, and let $\phi(x)=x^d+c \in K[x]$ be a unicritical polynomial of degree $d\geq2$ with $d \not\equiv 0,1\pmod{p}$. We completely…

Baader, J\"org, and Parlier recently established an upper bound for the crossing number of curve systems of size $m\asymp g^{1+\alpha}$ on a genus $g$ surface, obtaining a leading coefficient of $9/4=2.25$. Their construction relies on…

Herein we prove an upper bound on the number of gravitationally lensed images in a generic multiplane point-mass ensemble with K planes and g_i masses in the ith plane. With E_K and O_K the sums of the even and odd degree terms respectively…

Let A be a commutative domain containing Z which is finitely generated as a Z-algebra, and let a,b,c be non-zero elements of A. It follows from work of Siegel, Mahler, Parry and Lang that the equation (*) ax+by=c has only finitely many…

Let $k \geq 3$. We prove the following three bounds for the matching number, $\alpha'(G)$, of a graph, $G$, of order $n$ size $m$ and maximum degree at most $k$. If $k$ is odd, then $\alpha'(G) \ge \left( \frac{k-1}{k(k^2 - 3)} \right) n \,…

The aim of this article is to study (additively) indecomposable algebraic integers $\mathcal O_K$ of biquadratic number fields $K$ and universal totally positive quadratic forms with coefficients in $\mathcal O_K$. There are given…

We analyze the behavior of the Euclidean algorithm applied to pairs (g,f) of univariate nonconstant polynomials over a finite field F_q of q elements when the highest-degree polynomial g is fixed. Considering all the elements f of fixed…