Related papers: A discretized approach to W.T. Gowers' game
The need to smoothly cover a computational domain of interest generically requires the adoption of several grids. To solve the problem of interest under this grid-structure one must ensure the suitable transfer of information among the…
This paper is concerned with the open problem proposed in Ammari et. al. Commun. Math.Phys, 2013. We first investigate the existence and uniqueness of Generalized Polarization Tensors (GPTs) vanishing structures locally in both two and…
A class of nets in constructive (in A.A.Markov's sense) topological space for which the convergence is equivalent to convergence of all subsequences, is described. B.A.Kushner's theorem about coincidence of strong and weak constructive…
We prove that under suitable graded and local hypothesis, a formally unramified algebra over a field must be reduced. We detail examples, including one due to Gabber, to show that it is not possible to generalize these results further.
We formulate and establish a generalization of Koll\'ar's injectivity theorem for adjoint bundles twisted by suitable multiplier ideal sheaves. As applications, we generalize Koll\'ar's torsion-freeness, Koll\'ar's vanishing theorem, and a…
The Gumbel trick is a method to sample from a discrete probability distribution, or to estimate its normalizing partition function. The method relies on repeatedly applying a random perturbation to the distribution in a particular way, each…
A simple theory for the leading-order correction g_1(r) to the structure of a hard-sphere liquid with discrete (e.g. square-well) potential perturbations is proposed. The theory makes use of a general approximation that effectively…
The inverse theory for Gowers uniformity norms is one of the central topics in additive combinatorics and one of the most important aspects of the theory is the question of bounds. In this paper, we prove a quasipolynomial inverse theorem…
We prove the existence of a Galois closure for towers of torsors under finite group schemes over a proper, geometrically connected and geometrically reduced algebraic stack $X$ over a field $k$. This is done by describing the Nori…
We first establish a general random Sperner lemma by presenting a completely new approach for the theory of $L^{0}$-simplicial subdivisions of $L^{0}$-simplexes. Based on this, we are able to achieve a new complete proof of the random…
This paper introduces a systematic methodological framework to design and analyze distributed algorithms for optimization and games over networks. Starting from a centralized method, we identify an aggregation function involving all the…
Motivated by better understanding the bideterminant (=product of minors) basis on the polynomial ring in $n \times m$ variables, we develop theory \& algorithms for Gr\"obner bases in not only algebras with straightening law (ASLs or Hodge…
The probability distributions of discrete-time quantum walks have been often investigated, and many interesting properties of them have been discovered. The probability that the walker can be find at a position is defined by diagonal…
Assuming sufficiently many terms of a n-dimensional table defined over a field are given, we aim at guessing the linear recurrence relations with either constant or polynomial coefficients they satisfy. In many applications, the table terms…
In this paper we study a very general finite Ramsey theorem, where both the sets being colored and the homogeneous set must satisfy some largeness notion. For the homogeneous set this has already been done using the notion of…
In this paper, We develop the stratified de Rham theory on singular spaces using modern tools including derived geometry and stratified structures. This work unifies and extends the de Rham theory, Hodge theory, and deformation theory of…
We address the question of symmetries of an important type of quantum walks. We introduce all the necessary definitions and provide a rigorous formulation of the problem. Using a thorough analysis, we reach the complete answer by presenting…
We solve a question of Gowers from 2009 on clique differences in chains, thus ruling out any Sperner-type proof of the polynomial density Hales-Jewett theorem for alphabets of size 2.
The class of Guaranteed Scoring Games (GS) are two-player combinatorial games with the property that Normal-play games (Conway et. al.) are ordered embedded into GS. They include, as subclasses, the scoring games considered by Milnor…
We compare complex networks built from the game of go and obtained from databases of human-played games with those obtained from computer-played games. Our investigations show that statistical features of the human-based networks and the…