Related papers: A Tensor Restriction Theorem over Finite Fields

A well-quasi-order is an order which contains no infinite decreasing sequence and no infinite collection of incomparable elements. In this paper, we consider graph classes defined by excluding one graph as contraction. More precisely, we…

In this thesis we consider ordered graphs (that is, graphs with a fixed linear ordering on their vertices). We summarize and further investigations on the number of edges an ordered graph may have while avoiding a fixed forbidden ordered…

The set of quasipositive surfaces is closed under incompressible inclusion. We prove that the induced order on fibre surfaces of positive braid links is almost a well-quasi-order. When restricting to quasipositive surfaces containing a…

Robertson and Seymour's celebrated Graph Minor Theorem states that graphs are well-quasi-ordered by the minor relation. Unlike the minor relation, the topological minor relation does not well-quasi-order graphs in general. Among all known…

For tensors of fixed order, we establish three types of upper bounds for the geometric rank in terms of the subrank. Firstly, we prove that, under a mild condition on the characteristic of the base field, the geometric rank of a tensor is…

We study restriction problem in vector spaces over finite fields. We obtain finite field analogue of Mockenhaupt-Mitsis-Bak-Seenger restriction theorem, and we show that the range of the exponentials is sharp.

In this note, we consider Szemer\'{e}di's theorem on $k$-term arithmetic progressions over finite fields $\mathbb{F}_p^n$, where the allowed set $S$ of common differences in these progressions is chosen randomly of fixed size. Combining a…

A theorem due to Kazhdan and Ziegler implies that, by substituting linear forms for its variables, a homogeneous polynomial of sufficiently high strength specialises to any given polynomial of the same degree in a bounded number of…

Words are sequences of letters over a finite alphabet. We study two intimately related topics for this object: quasi-randomness and limit theory. With respect to the first topic we investigate the notion of uniform distribution of letters…

We prove the first inverse theorem for point--sphere incidence bounds over finite fields in dimensions $d \ge 3$, showing that near-extremality forces algebraic rigidity. While sharp upper bounds have been known for over a decade, the…

Tensors are often studied by introducing preorders such as restriction and degeneration: the former describes transformations of the tensors by local linear maps on its tensor factors; the latter describes transformations where the local…

We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It…

We present a new structure theorem for finite fields of odd order that relates multiplicative and additive structure in an interesting way. This theorem has several applications, including an improved understanding of Dickson and Chebyshev…

We prove a converse theorem for the case of quasi-split non-split even special orthogonal groups over finite fields. There are two main difficulties which arise from the outer automorphism and non-split part of the torus. The outer…

In this paper we give an asymptotically tight bound for the tolerated Tverberg Theorem when the dimension and the size of the partition are fixed. To achieve this we study certain partitions of order-type homogeneous sets and use a…

We use the theory of graph limits to study several quasi-random properties, mainly dealing with various versions of hereditary subgraph counts. The main idea is to transfer the properties of (sequences of) graphs to properties of graphons,…

Matrices of rank at most k are defined by the vanishing of polynomials of degree k + 1 in their entries (namely, their (k + 1)-times-(k + 1)-subdeterminants), regardless of the size of the matrix. We prove a qualitative analogue of this…

A contraction sequence of a graph consists of iteratively merging two of its vertices until only one vertex remains. The recently introduced twin-width graph invariant is based on contraction sequences. More precisely, if one puts red edges…

In the aftermath of the Robertson--Seymour Graph Minor Theorem, Thomas conjectured that the countable graphs are well-quasi-ordered under the minor relation. We prove that this conjecture, when restricted to graphs with no infinite paths…

Restriction categories were established to handle maps that are partially defined with respect to composition. Tensor topology realises that monoidal categories have an intrinsic notion of space, and deals with objects and maps that are…