SearcharxivSearch

arXiv subjects

Shamil Asgarli

Publications and source records attributed to Shamil Asgarli.

At least 19 recordsLinked to original sources

Intersecting families and nonvanishing multivariate polynomials over finite fields

Let $\mathcal{P}_{n,d}$ be the space of polynomials in $n$ variables over $\mathbb{F}_q$ of degree at most $d$. Two polynomials $f,g\in\mathcal{P}_{n,d}$ intersect if $f(\mathbf a)=g(\mathbf a)$ for some $\mathbf a\in\mathbb{F}_q^n$. A star consists of all polynomials $f\in\mathcal{P}_{n,d}$ satisfying $f(\mathbf a)=b$ for fixed $\mathbf a\in\mathbb{F}_q^n$ and $b\in\mathbb{F}_q$. We completely classify the maximum intersecting families in $\mathcal{P}_{n,d}$. When $n=1$ and $d\geq 2$, it was previously shown that all maximum intersecting families are stars. We prove that the same conclusion holds for all $n\geq 2$ and $d\geq 2$ when $q$ is odd. When $q$ is even, however, the situation is more subtle, and a new phenomenon emerges: for $q\geq 4$, maximum non-star examples exist precisely when $d\leq n$. Along the way, we prove two further results of independent interest. First, we determine the span of nonvanishing polynomials in $\mathcal{P}_{n,d}$. Second, we characterize all linear functionals $\Psi\colon\mathcal{P}_{n,d}\to\mathbb{F}_q$ whose kernels are disjoint from the set of nonvanishing polynomials. The first result plays a crucial role in the proof of our main result; the second is a Gleason--Kahane--\.{Z}elazko theorem for polynomials of bounded degree over finite fields.

math.NT

Defective chromatic polynomials

For a graph $G$ and an integer $d\geq 0$, the defective chromatic polynomial $\chi_d(G;k)$ counts the $k$-colorings of $G$ in which each vertex has at most $d$ neighbors of its own color. We investigate which structural properties of $G$ are determined by the full family $\{\chi_d(G;k)\}_{d\geq 0}$. We establish a contraction formula expressing $\chi_d(G;k)$ as a sum of ordinary chromatic polynomials of the edge contractions of $G$. As a first application, we prove that for triangle-free graphs, the full family determines the degree sequence. For trees, we show further that the family $\{\chi_d(T;k)\}_{d\geq 0}$ determines the path-subgraph counts $N(P_j,T)$ for $j=1,2,3,4$, but not for $j=5$. For each $n\geq 9$, we construct a pair of nonisomorphic trees of order $n$ that share the same defective chromatic polynomials for every $d\geq 0$.

math.CO

An Erd\H{o}s-Ko-Rado theorem for binary codes

We study intersecting families of words from the Erd\H{o}s-Ko-Rado perspective. When the alphabet size is $2$, a maximum intersecting family is not necessarily a star. However, we prove that every maximum $3$-wise intersecting family is a star. We also present a new proof of the known result for alphabets of size at least $3$: maximum intersecting families of words are exactly the stars.

math.CO

Bell coloring graphs: realizability and reconstruction

Given a graph $G$, the Bell $k$-coloring graph $\mathcal{B}_k(G)$ has vertices given by partitions of $V(G)$ into $k$ independent sets (allowing empty parts), with two partitions adjacent if they differ only in the placement of a single vertex. We first give a structural classification of cliques in Bell coloring graphs. We then show that all trees and all cycles arise as Bell coloring graphs, while $K_4-e$ is not a Bell coloring graph and, more generally, $K_n-e$ is not an induced subgraph of any Bell coloring graph whenever $n \geq 6$. We also prove two reconstruction results: the Bell $3$-coloring graph is a complete invariant for trees, and the Bell $n$-coloring multigraph determines any graph up to universal vertices.

math.CO

Extremal diameters of 3-coloring graphs of trees

Given a tree $T$, its 3-coloring graph $\mathcal{C}_3(T)$ has as vertices the proper 3-colorings of $T$, with edges joining colorings that differ at exactly one vertex. We call the diameter of $\mathcal{C}_3(T)$ the 3-coloring diameter of $T$. We introduce the notion of balanced labelings of $T$ and show that the 3-coloring diameter equals the maximum $L_1$-norm of a balanced labeling. Using this equivalence, we determine the maximum and minimum values of the 3-coloring diameter over all trees on $n$ vertices and characterize the extremal trees.

math.CO

Improved lower bounds for the maximum order of an induced acyclic subgraph

Computing the cardinality of a maximum induced acyclic vertex set in a digraph is NP-hard. Since finding an exact solution is computationally difficult, a fruitful approach is to establish high-quality lower bounds that are efficiently computable. We build on the Akbari--Ghodrati--Jabalameli--Saghafian (AGJS) bound for digraphs by adapting refinement techniques used by (a) Selkow and Harant--Mohr and (b) Angel--Campigotto--Laforest in their respective improvements of the Caro--Wei bound for undirected graphs. First, inspired by (a), we prove a neighborhood-based refinement of the AGJS bound that incorporates local degree data of each vertex. Second, inspired by (b), we compute the variance of the size of a feedback vertex set returned by a randomized algorithm. This result, combined with the Bhatia--Davis inequality, yields a tighter lower bound than the AGJS bound.

math.CO

Blocking sets from a union of plane curves

Motivated by a question of Erdős on blocking sets in a projective plane that intersect every line only a few times, several authors have used unions of algebraic curves to construct such sets in $\mathbb{P}^2(\mathbb{F}_q)$. In this paper, we provide new constructions of blocking sets in $\mathbb{P}^2(\mathbb{F}_q)$ from a union of geometrically irreducible curves of a fixed degree $d$. We also establish lower bounds on the number of such curves required to form a blocking set. Our proofs combine tools from arithmetic geometry and combinatorics.

math.AG

Collision of orbits for families of polynomials defined over fields of positive characteristic

Let $L$ be a field of positive characteristic $p$ with a fixed algebraic closure $\overline{L}$, and let $\alpha_1,\alpha_2,\beta\in L$. For an integer $d\ge 2$, we consider the family of polynomials $f_{\lambda}(z) := z^d+\lambda$, parameterized by $\lambda\in\overline{L}$. Define $C(\alpha_1,\alpha_2;\beta)$ to be the set of all $\lambda\in\overline{L}$ for which there exist $m,n\in\mathbb{N}$ such that $f_{\lambda}^m(\alpha_1)=f_{\lambda}^n(\alpha_2)=\beta$. In other words, $C(\alpha_1,\alpha_2;\beta)$ consists of all $\lambda\in\overline{L}$ with the property that the orbit of $\alpha_1$ collides with the orbit of $\alpha_2$ under the same polynomial $f_{\lambda}$ precisely at the point $\beta$. Assuming $\alpha_1,\alpha_2,\beta$ are not all contained in a finite subfield of $L$, we provide explicit necessary and sufficient conditions under which $C(\alpha_1,\alpha_2;\beta)$ is infinite. We also discuss the remaining case where $\alpha_1,\alpha_2,\beta\in \overline{\mathbb F}_p$ and provide ample computational data that suggest a somewhat surprising conjecture. Our problem fits into a long series of questions in the area of unlikely intersections in arithmetic dynamics, which have been primarily studied over fields of characteristic $0$. Working in characteristic $p$ adds significant difficulties, but also reveals the subtlety of our problem, especially when some of the points lie in a finite field or when $d$ is a power of $p$.

math.NT

Proportion of blocking curves in a pencil

Let $\mathcal{L}$ be a pencil of plane curves defined over $\mathbb{F}_q$ with no $\mathbb{F}_q$-points in its base locus. We investigate the number of curves in $\mathcal{L}$ whose $\mathbb{F}_q$-points form a blocking set. When the degree of the pencil is allowed to grow with respect to $q$, we show that the geometric problem can be translated into a purely combinatorial problem about disjoint blocking sets. We also study the same problem when the degree of the pencil is fixed.

math.AG

Counting subgraphs of coloring graphs

The chromatic polynomial $π_{G}(k)$ of a graph $G$ can be viewed as counting the number of vertices in a family of coloring graphs $\mathcal C_k(G)$ associated with (proper) $k$-colorings of $G$ as a function of the number of colors $k$. These coloring graphs can be understood as a reconfiguration system. We generalize the chromatic polynomial to $π_G^{(H)}(k)$, counting occurrences of arbitrary induced subgraphs $H$ in these coloring graphs, and we prove that these functions are polynomial in $k$. In particular, we study the chromatic pairs polynomial $π_{G}^{(P_2)}(k)$, which counts the number of edges in coloring graphs, corresponding to the number of pairs of colorings that differ on a single vertex. We show two trees share a chromatic pairs polynomial if and only if they have the same degree sequence, and we conjecture that the chromatic pairs polynomial refines the chromatic polynomial in general. We also instantiate our polynomials with other choices of $H$ to generate new graph invariants.

math.CO

Coloring graphs as complete graph invariants

We investigate the extent to which the $k$-coloring graph $\mathcal{C}_{k}(G)$ uniquely determines the base graph $G$ and the number of colors $k$. The vertices of $\mathcal{C}_{k}(G)$ are the proper $k$-colorings of $G$, and edges connect colorings that differ on exactly one vertex. There are nonisomorphic graphs $G_1$ and $G_2$ with isomorphic coloring graphs, so $\mathcal{C}_{k}(G)$ is not a complete invariant in general. However, for color palettes with surplus colors (when the number of colors $k$ is greater than the chromatic number), we prove that the coloring graph is a complete invariant. Specifically, provided that $k_1 > \chi(G_1)$, we show that $\mathcal{C}_{k_1}(G_1)\cong \mathcal{C}_{k_2}(G_2)$ implies $G_1\cong G_2$ and $k_1=k_2$. Thus, there is a natural bijection between pairs $(G, k)$ with $k > \chi(G)$ and their coloring graphs $\mathcal{C}_k(G)$. Furthermore, no coloring graph of the form $\mathcal{C}_{\chi(G)}(G)$ is isomorphic to a coloring graph with surplus colors. Our constructive proof provides a method to decide whether a coloring graph is generated with surplus colors, although the resulting algorithms are inefficient.

math.CO

Mutual position of two smooth quadrics over finite fields

Given two irreducible conics $C$ and $D$ over a finite field $\mathbb{F}_q$ with $q$ odd, we show that there are $q^2/4+O(q^{3/2})$ points $P$ in $\mathbb{P}^2(\mathbb{F}_q)$ such that $P$ is external to $C$ and internal to $D$. This answers a question of Korchmáros. We also prove the analogous result for higher-dimensional smooth quadric hypersurfaces in $\mathbb{P}^{n-1}$ with $n$ odd, where the answer is $q^{n-1}/4+O(q^{n-\frac{3}{2}})$.

math.AG

Chromatic quasisymmetric functions of the path graph

We show that the chromatic quasisymmetric function (CQF) of a labeled path graph on $n$ vertices is not symmetric unless the labeling is the natural labeling $1, 2, ..., n$ or its reverse $n, ..., 2, 1$. We also show that the star graph $K_{1, n-1}$ with $n\geq 3$ has a nonsymmetric CQF for all labelings.

math.CO

Hypersurfaces passing through the Galois orbit of a point

Asgarli, Ghioca, and Reichstein proved that if $K$ is a field with $|K|>2$, then for any positive integers $d$ and $n$, and separable field extension $L/K$ with degree $m=\binom{n+d}{d}$, there exists a point $P\in \mathbb{P}^n(L)$ which does not lie on any degree $d$ hypersurface defined over $K$. They asked whether the result holds when $|K| = 2$. We answer their question in the affirmative by combining various ideas from arithmetic geometry. More generally, we show that for each positive integer $r$ and separable field extension $L/K$ with degree $r$, there exists a point $P \in \mathbb{P}^n(L)$ such that the vector space of degree $d$ forms over $K$ that vanish at $P$ has the expected dimension. We also discuss applications to linear systems of hypersurfaces with special properties.

math.AG

Linear system of geometrically irreducible plane cubics over finite fields

We examine the maximum dimension of a linear system of plane cubic curves whose $\mathbb{F}_q$-members are all geometrically irreducible. Computational evidence suggests that such a system has a maximum (projective) dimension of $3$. As a step towards the conjecture, we prove that there exists a $3$-dimensional linear system $\mathcal{L}$ with at most one geometrically reducible $\mathbb{F}_q$-member.

math.AG

Frobenius nonclassical hypersurfaces

A smooth hypersurface over a finite field $\mathbb{F}_q$ is called Frobenius nonclassical if the image of every geometric point under the $q$-th Frobenius endomorphism remains in the unique hyperplane tangent to the point. In this paper, we establish sharp lower and upper bounds for the degrees of such hypersurfaces, give characterizations for those achieving the maximal degrees, and prove in the surface case that they are Hermitian when their degrees attain the minimum. We also prove that the set of $\mathbb{F}_q$-rational points on a Frobenius nonclassical hypersurface form a blocking set with respect to lines, which indicates the existence of many $\mathbb{F}_q$-points.

math.AG

Linear system of hypersurfaces passing through a Galois orbit

Let $d$ and $n$ be positive integers, and $E/F$ be a separable field extension of degree $m=\binom{n+d}{n}$. We show that if $|F| > 2$, then there exists a point $P\in \mathbb{P}^n(E)$ which does not lie on any degree $d$ hypersurface defined over $F$. In other words, the $m$ Galois conjugates of $P$ impose independent conditions on the $m$-dimensional $F$-vector space of degree $d$ forms in $x_0, x_1, \ldots, x_n$. As an application, we determine the maximal dimensions of linear systems $\mathcal{L}_1$ and $\mathcal{L}_2$ of hypersurfaces in $\mathbb P^n$ over a finite field $F$, where every $F$-member of $\mathcal{L}_1$ is reducible and every $F$-member of $\mathcal{L}_2$ is irreducible.

math.AG

The subspace structure of maximum cliques in pseudo-Paley graphs from unions of cyclotomic classes

Blokhuis showed that all maximum cliques in Paley graphs of square order have a subfield structure. Recently, it has been shown that in Peisert-type graphs, all maximum cliques are affine subspaces, and yet some maximum cliques do not arise from a subfield. In this paper, we investigate the existence of a clique of size $\sqrt{q}$ with a subspace structure in pseudo-Paley graphs of order $q$ from unions of semi-primitive cyclotomic classes. We show that such a clique must have an equal contribution from each cyclotomic class and that most such pseudo-Paley graphs do not admit such cliques, suggesting that the Delsarte bound $\sqrt{q}$ on the clique number can be improved in general. We also prove that generalized Peisert graphs are not isomorphic to Paley graphs or Peisert graphs, confirming a conjecture of Mullin.

math.CO