Related papers: A discretized approach to W.T. Gowers' game
We give an operator-algebraic formulation of robust self-testing in terms of states on C*-algebras. We show that a quantum correlation p is a robust self-test only if among all (abstract) states, there is a unique one achieving p. We show…
We characterize group compactifications of discrete groups for which there exists an equivariant retraction onto the boundary. In particular, we prove an equivariant analogue of Brouwer's No-Retraction theorem for large classes of group…
In the present paper, based on the previous work (Part I), we present a game semantics for the intensional variant of intuitionistic type theory that refutes the principle of uniqueness of identity proofs and validates the univalence axiom,…
We provide an operator algebraic interpretation of discrete measurable groupoids in the course of re-proving (and slightly generalizing) a result on treeability due to Adams and Spatzier. Then, we reconstruct Gaboriau's beautiful work on…
Multiobjective discrete programming is a well-known family of optimization problems with a large spectrum of applications. The linear case has been tackled by many authors during the last years. However, the polynomial case has not been…
In this short note, we extend a local $Tb$ theorem that was proved in \cite{GHO} to a full multilinear local $Tb$ theorem.
We determine the blocks of the walled Brauer algebra in characteristic zero. These can be described in terms of orbits of the action of a Weyl group of type $A$ on a certain set of weights. In positive characteristic we give a linkage…
We state and prove a quantitative inverse theorem for the Gowers uniformity norm $U^3(G)$ on an arbitrary finite abelian group $G$; the cases when $G$ was of odd order or a vector space over ${\mathbf F}_2$ had previously been established…
We analyze the Brandenburger-Keisler paradox in epistemic game theory, which is a `two-person version of Russell's paradox'. Our aim is to understand how it relates to standard one-person arguments, and why the `believes-assumes' modality…
One standard way to prove existence for deterministic, highly nonlinear PDEs is to use the Schauder-Tychonoff fixed-point theorem. In what follows, we introduce and verify a stochastic variant of the Schauder-Tychonoff theorem. We apply our…
The purpose of this paper is twofold. 1. We give combinatorial bounds on the ranks of the groups $\Tor^{R}_\bullet(k,k)_\bullet$ in the case where $R = k[\Lambda]$ is an affine semi-group ring, and in the process provide combinatorial…
We present a new kind of basis function for discretizing the Schr\"odinger equation in electronic structure calculations, called a gausslet, which has wavelet-like features but is composed of a sum of Gaussians. Gausslets are placed on a…
We introduce methods that allow to derive continuous-time versions of various discrete-time ergodic theorems. We then illustrate these methods by giving simple proofs and refinements of some known results as well as establishing new results…
The Erdos-Moser theorem (EM) states that every infinite tournament has an infinite transitive subtournament. This principle plays an important role in the understanding of the computational strength of Ramsey's theorem for pairs (RT^2_2) by…
We estimate Gowers uniformity norms for some classical automatic sequences, such as the Thue-Morse and Rudin-Shapiro sequences. The methods can also be extended to other automatic sequences. As an application, we asymptotically count…
The GVW algorithm, presented by Gao et al., is a signature-based algorithm for computing Gr\"obner bases. In this paper, a variant of GVW is presented. This new algorithm is called a monomial-oriented GVW algorithm or mo-GVW algorithm for…
We show that certain tilting results for quivers are formal consequences of stability, and as such are part of a formal calculus available in any abstract stable homotopy theory. Thus these results are for example valid over arbitrary…
By analogy with Weinstein's neighbourhood theorem, we prove a uniqueness result for symplectic neighbourhoods of a large family of stratified subspaces. This result generalizes existing constructions, e.g., in the search for exotic…
We develop a randomized Newton's method for solving differential equations, based on a fully connected neural network discretization. In particular, the randomized Newton's method randomly chooses equations from the overdetermined nonlinear…
In this paper we introduce a working generalization of the theory of Gr\"obner bases for algebras of partial difference polynomials with constant coefficients. One obtains symbolic (formal) computation for systems of linear or non-linear…