Related papers: Edge-isoperimetric problem for Cayley graphs and g…
Let $A = \prod_{1\leq i\leq n} A_i$ be the product of principally polarized abelian varieties $A_1, \ldots, A_n$ of dimensions $g_1, \ldots, g_n$, respectively, each defined over a number field $K$, and pairwise nonisogenous over…
For a graph $G$, let $S_2(G)$ be the sum of the first two largest signless Laplacian eigenvalues of $G$, and $f(G)=e(G)+3-S_2(G)$. Oliveira, Lima, Rama and Carvalho conjectured that $K^+_{1,n-1}$ (the star graph with an additional edge) is…
This paper is a new contribution to the partial Galois theory of groups. First, given a unital partial action $\alpha_G$ of a finite group $G$ on an algebra $S$ such that $S$ is an $\alpha_G$-partial Galois extension of $S^{\alpha_G}$ and a…
Let $K$ be a number field and $A/K$ be an abelian variety of dimension $g$. Assuming that the image $G_{\ell^\infty}$ of the natural Galois representation attached to the Tate module $T_\ell(A)$ is $\operatorname{GSp}_{2g}(\mathbb{Z}_\ell)$…
For a graph $G=(V,\ E)$ and a nonempty set $S\subseteq V$, the \emph{vertex boundary} of $S$, denoted by $\partial_G(S)$, is defined to be the set of vertices that are not in $S$ but have at least one neighbor in $S$. In this paper, for $G$…
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. An orientable surface $\mathbb{S}_h$ of genus $h$, $h \geq 0$, is obtained from the sphere…
Fix an ordinary abelian variety defined over a finite field. The ideal class group of its endomorphism ring acts freely on the set of isogenous varieties with same endomorphism ring, by complex multiplication. Any subgroup of the class…
A result of Pyber states that every finite group $G$ contains an abelian subgroup whose order is quasi-polynomially large in $\lvert G\rvert$. We prove a similar result for $K$-approximate subgroups of solvable groups under only modest…
Let $A\neq A_1, A_2, I_{2m}$ be an irreducible Artin--Tits group of spherical type. We show that periodic elements of $A$ and the elements preserving some parabolic subgroup of $A$ act elliptically on the additional length graph…
Fix an abelian variety $A$ of dimension $g\geq 1$ defined over a number field $K$. For each prime $\ell$, the Galois action on the $\ell$-power torsion points of $A$ induces a representation $\rho_{A,\ell}\colon Gal_K \to…
We consider $m$-colorings of the edges of a complete graph, where each color class is defined semi-algebraically with bounded complexity. The case $m = 2$ was first studied by Alon et al., who applied this framework to obtain surprisingly…
Let $G$ be a finite group, $S\subseteq G\setminus\{1\}$ be a set such that if $a\in S$, then $a^{-1}\in S$, where $1$ denotes the identity element of $G$. The undirected Cayley graph $Cay(G,S)$ of $G$ over the set $S$ is the graph whose…
The sandpile group of a connected graph $G$, defined to be the torsion part of the cokernel of the graph Laplacian, is a subtle graph invariant with combinatorial, algebraic, and geometric descriptions. Extending and improving previous…
We say that finite groups are isospectral if they have the same sets of orders of elements. It is known that every nonsolvable finite group $G$ isospectral to a finite simple group has a unique nonabelian composition factor, that is, the…
For any graded poset $P$, we define a new graded poset, $\mathcal E(P)$, whose elements are the edges in the Hasse diagram of P. For any group, $G$, acting on the boolean algebra, $B_n$, we conjecture that $\mathcal E(B_n/G)$ is Peck. We…
Ne\v{s}et\v{r}il and \v{S}\'{a}mal asked whether every cubelike graph has a cubelike core. Man\v{c}inska, Pivotto, Roberson and Royle answered this question in the affirmative for cubelike graphs whose core has at most $32$ vertices. When…
Cheeger's fundamental inequality states that any edge-weighted graph has a vertex subset $S$ such that its expansion (a.k.a. conductance) is bounded as follows: \[ \phi(S) \defeq \frac{w(S,\bar{S})}{\min \set{w(S), w(\bar{S})}} \leq…
We investigate the extremal properties of saturated partial plane embeddings of maximal planar graphs. For a planar graph $G$, the plane-saturation number $\mathrm{sat}_{\mathcal{P}}(G)$ denotes the minimum number of edges in a plane…
Given a graph $G$ and a positive integer $k$, define the \emph{Gallai-Ramsey number} to be the minimum number of vertices $n$ such that any $k$-edge coloring of $K_n$ contains either a rainbow (all different colored) triangle or a…
The edge isoperimetric inequality in the discrete cube specifies, for each pair of integers $m$ and $n$, the minimum size $g_n(m)$ of the edge boundary of an $m$-element subset of $\{0,1\}^{n}$; the extremal families (up to automorphisms of…