Related papers: A Tensor Restriction Theorem over Finite Fields
In this paper, our goal is to characterize two graph classes based on the properties of minimal vertex (edge) separators. We first present a structural characterization of graphs in which every minimal vertex separator is a stable set. We…
It is proved the the restriction of any supercharacter of a finite group of triangular type on its subgroup is a sum of supercharacters with nonnegative integer coefficients. We define superinduction and prove the analog of the Frobenius…
A well-known theorem of Lax and Wendroff states that if the sequence of approximate solutions to a system of hyperbolic conservation laws generated by a conservative consistent numerical scheme converges boundedly a.e. as the mesh parameter…
In Tensor Field Theory (TFT), observables are defined through tensor field contractions that produce unitary invariants for complex-valued tensor fields. Traditionally, these observables are constructed using tensor fields of a fixed order…
We define a natural notion of higher order stability and show that subsets of $\mathbb{F}_p^n$ that are tame in this sense can be approximately described by a union of low-complexity quadratic varieties, up to linear error. This generalizes…
Tensor products of ultrafilters have special combinatorial features closely related to Ramsey's Theorem, making them useful tools in applications. Here we first review their fundamental properties and isolate some new ones, including a…
We present a natural restriction of Hindman's Finite Sums Theorem that admits a simple combinatorial proof (one that does not also prove the full Finite Sums Theorem) and low computability-theoretic and proof-theoretic upper bounds, yet…
Given an order-$d$ tensor $\tensor A \in \R^{n \times n \times...\times n}$, we present a simple, element-wise sparsification algorithm that zeroes out all sufficiently small elements of $\tensor A$, keeps all sufficiently large elements of…
We pursue various restricted variable generalizations of the Chevalley-Warning theorem for low degree polynomial systems over a finite field. Our first such result involves variables restricted to Cartesian products of the Vandermonde…
Motivated by the work of Lov\'asz and Szegedy on the convergence and limits of dense graph sequences, we investigate the convergence and limits of finite trees with respect to sampling in normalized distance. Based on separable real trees,…
We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.
In this paper, we introduce the notion of Reidemeister torsion for quasi-isomorphisms of based chain complexes over a field. We call a chain map a quasi-isomorphism if its induced homomorphism between homology is an isomorphism. Our notion…
In this paper we define the closure under weak convergence of the class of p-tempered {\alpha}-stable distributions. We give necessary and sufficient conditions for convergence of sequences in this class. Moreover, we show that any element…
The restriction and Kakeya problems in Euclidean space have received much attention in the last few decades, and are related to many problems in harmonic analysis, PDE, and number theory. In this paper we initiate the study of these…
A finite semifield is a division algebra over a finite field where multiplication is not necessarily associative. We consider here the complexity of the multiplication in small semifields and finite field extensions. For this operation, the…
This is Part II of our work about random tensor inequalities and tail bounds for bivariate random tensor means. After reviewing basic facts about random tensors, we first consider tail bounds with more general connection functions. Then, a…
We show that Ramsey theory, a domain presently conceived to guarantee the existence of large homogeneous sets for partitions on k-tuples of words (for every natural number k) over a finite alphabet, can be extended to one for partitions on…
A tensor is a multidimensional array of numbers that can be used to store data, encode a computational relation and represent quantum entanglement. In this sense a tensor can be viewed as valuable resource whose transformation can lead to…
Fractons and other subdimensional particles are an exotic class of emergent quasi-particle excitations with severely restricted mobility. A wide class of models featuring these quasi-particles have a natural description in the language of…
We study orthogonal decompositions of symmetric and ordinary tensors using methods from linear algebra. For the field of real numbers we show that the sets of decomposable tensors can be defined be equations of degree 2. This gives a new…