activity
20172026
most citedVan Lint-MacWilliams' conjecture and maximum cliques in Cayley graphs over finite fields

15 citations · 54 across the 30 of their papers we have counts for

collaborators

37 papers

math.AG2026

Covering plane curves over finite fields with lines

Shamil Asgarli, Sarthak Dassarma, Dragos Ghioca +2

We prove that, for every fixed and , the -points of a geometrically irreducible reflexive plane curve of degree over can b…

math.AG2026

A geometric approach to the density of rank-metric codes

Shamil Asgarli, Lian Duan, Nathan Kaplan +1

We study the asymptotic density of -point-free linear sections of geometrically irreducible projective varieties over finite fields. We then apply these results to ra…

math.NT2026

Intersecting families and nonvanishing multivariate polynomials over finite fields

Shamil Asgarli, Bence Csajbók, Chi Hoi Yip

Let be the space of polynomials in variables over of degree at most . Two polynomials intersect if $f(\mathbf a)…

math.CO2026

Defective chromatic polynomials

Shamil Asgarli, Tamsen Whitehead McGinley, Nicholas Xue

For a graph and an integer , the defective chromatic polynomial counts the -colorings of in which each vertex has at most neighbors of its own co…

math.CO2026

An Erdős-Ko-Rado theorem for binary codes

Shamil Asgarli, Chi Hoi Yip

We study intersecting families of words from the Erdős-Ko-Rado perspective. When the alphabet size is , a maximum intersecting family is not necessarily a star. However, we prov…

math.CO2026

Extremal diameters of 3-coloring graphs of trees

Shamil Asgarli, Sara Krehbiel, Simon MacLean +1

Given a tree , its 3-coloring graph has as vertices the proper 3-colorings of , with edges joining colorings that differ at exactly one vertex. We call the…

math.CO2025

Bell coloring graphs: realizability and reconstruction

Shamil Asgarli, Sara Krehbiel, Simon MacLean

Given a graph , the Bell -coloring graph has vertices given by partitions of into independent sets (allowing empty parts), with two partitions a…

math.CO2025

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

Shamil Asgarli, Donald Falkenhagen, Kaya Hoshi

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 e…

math.AG2025

Blocking sets from a union of plane curves

Shamil Asgarli, Dragos Ghioca, Chi Hoi Yip

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 construc…

math.NT2025

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

Shamil Asgarli, Dragos Ghioca

Let be a field of positive characteristic with a fixed algebraic closure , and let . For an integer , we consider the family of polyno…

math.CO2025

Coloring graphs as complete graph invariants

Shamil Asgarli, Sara Krehbiel, Howard W. Levinson

We investigate the extent to which the -coloring graph uniquely determines the base graph and the number of colors . The vertices of $\mathcal{C}_{k}…

math.AG2025

Hypersurfaces passing through the Galois orbit of a point

Shamil Asgarli, Jonathan Love, Chi Hoi Yip

Asgarli, Ghioca, and Reichstein proved that if is a field with , then for any positive integers and , and separable field extension with degree $m=\binom{n+…

math.CO2024

Chromatic quasisymmetric functions of the path graph

Farid Aliniaeifard, Shamil Asgarli, Maria Esipova +3

We show that the chromatic quasisymmetric function (CQF) of a labeled path graph on vertices is not symmetric unless the labeling is the natural labeling or its…

math.AG2024

Linear system of geometrically irreducible plane cubics over finite fields

Shamil Asgarli, Dragos Ghioca

We examine the maximum dimension of a linear system of plane cubic curves whose -members are all geometrically irreducible. Computational evidence suggests that such…

math.AG2024

Mutual position of two smooth quadrics over finite fields

Shamil Asgarli, Chi Hoi Yip

Given two irreducible conics and over a finite field with odd, we show that there are points in such…

math.CO2024

Counting subgraphs of coloring graphs

Shamil Asgarli, Sara Krehbiel, Howard W. Levinson +1

The chromatic polynomial of a graph can be viewed as counting the number of vertices in a family of coloring graphs associated with (proper) -co…

math.AG2023

Linear system of hypersurfaces passing through a Galois orbit

Shamil Asgarli, Dragos Ghioca, Zinovy Reichstein

Let and be positive integers, and be a separable field extension of degree . We show that if , then there exists a point $P\in \mathbb{P}^n…

math.AG2023

Plane-filling curves of small degree over finite fields

Shamil Asgarli, Dragos Ghioca

A plane curve in defined over is called plane-filling if contains every -point of . Homma and Kim, building on the…

math.AG2023

Tangent-filling plane curves over finite fields

Shamil Asgarli, Dragos Ghioca

We study plane curves over finite fields whose tangent lines at smooth -points together cover all the points of .

math.HO2023

A Fair Shake: How close can the sum of -sided dice be to a uniform distribution?

Shamil Asgarli, Michael Hartglass, Daniel Ostrov +1

Two possibly unfair -sided dice, both labelled , are rolled, and the sum is recorded. How should the dice's sides be weighted so that the resulting sum is close…

math.AG2023★ 5 cited

Existence of pencils with nonblocking hypersurfaces

Shamil Asgarli, Dragos Ghioca, Chi Hoi Yip

We prove that there is a pencil of hypersurfaces in of any given degree over a finite field such that every -member of the pencil is not…

math.AG2023

Proportion of blocking curves in a pencil

Shamil Asgarli, Dragos Ghioca, Chi Hoi Yip

Let be a pencil of plane curves defined over with no -points in its base locus. We investigate the number of curves in whos…

math.AG2022★ 2 cited

Most plane curves over finite fields are not blocking

Shamil Asgarli, Dragos Ghioca, Chi Hoi Yip

A plane curve of degree is called \emph{blocking} if every -line in the plane meets at some -point. We prove that the pro…

math.AG2022★ 5 cited

Plane curves giving rise to blocking sets over finite fields

Shamil Asgarli, Dragos Ghioca, Chi Hoi Yip

In recent years, many useful applications of the polynomial method have emerged in finite geometry. Indeed, algebraic curves, especially those defined by Rédei-type polynomials, ar…