Related papers: Eliminating Human Insight: An Algorithmic Proof of…

Following the breakthrough of Croot, Lev, and Pach, Tao introduced a symmetrized version of their argument, which is now known as the slice rank method. In this paper, we introduce a more general version of the slice rank of a tensor, which…

Steingrimsson has recently introduced a partition analogue of Foata-Zeilberger's mak statistic for permutations and conjectured that its generating function is equal to the classical q-Stirling numbers of second kind. In this paper we prove…

Stanley's theory of $(P,\omega)$-partitions is a standard tool in combinatorics. It can be extended to allow for the presence of a restriction, that is a given maximal value for partitions at each vertex of the poset, as was shown by Assaf…

It is a well known fact from the group theory that irreducible tensor representations of classical groups are suitably characterized by irreducible representations of the symmetric groups. However, due to their different nature, vector and…

We present an exact spin-elimination technique that reduces the dimensionality of both quadratic and k-local Ising Hamiltonians while preserving their original ground-state configurations. By systematically replacing each removed spin with…

This paper is a tutorial in a general and explicit procedure to simplify semidefinite programs which are invariant under the action of a symmetry group. The procedure is based on basic notions of representation theory of finite groups. As…

The aim of the paper is to derive essential elements of quantum mechanics from a parametric structure extending that of traditional mathematical statistics. The main extensions, which also can be motivated from an applied statistics point…

We consider an exclusion process on a periodic one-dimensional lattice where all particles perform simple symmetric exclusion at rate $1$ except for a single tracer particle, which performs partially simple asymmetric exclusion with rate…

Herbrand's theorem plays an important role both in proof theory and in computer science. Given a Herbrand skeleton, which is basically a number specifying the count of disjunctions of the matrix, we would like to get a computable bound on…

We prove a conjecture of Toponogov on complete convex planes, namely that such planes must contain an umbilic point, albeit at infinity. Our proof is indirect. It uses Fredholm regularity of an associated Riemann-Hilbert boundary value…

We give a systematic method of providing numerical evidence for higher order Stark-type conjectures such as (in chronological order) Stark's conjecture over $\mathbb{Q}$, Rubin's conjecture, Popescu's conjecture, and a conjecture due to…

We present several continued fraction algorithms, each of which gives an eventually periodic expansion for every quadratic element of ${\mathbb Q}_p$ over ${\mathbb Q}$ and gives a finite expansion for every rational number. We also give,…

We propose an aproach for asymptotic analysis of plane partition statistics related to counts of parts whose sizes exceed a certain suitably chosen level. In our study, we use the concept of conjugate trace of a plane partition of the…

We propose a methodology for studying the performance of common splitting methods through semidefinite programming. We prove tightness of the methodology and demonstrate its value by presenting two applications of it. First, we use the…

Algorithmic entropy can be seen as a special case of entropy as studied in statistical mechanics. This viewpoint allows us to apply many techniques developed for use in thermodynamics to the subject of algorithmic information theory. In…

The long-standing topological Tverberg conjecture claimed, for any continuous map from the boundary of an $N(q,d):=(q-1)(d+1)$-simplex to $d$-dimensional Euclidian space, the existence of $q$ pairwise disjoint subfaces whose images have…

Classical existence theorems and solution methods for quadratic programming traditionally rely on the analytical properties of real numbers, specifically compactness and completeness. These tools are unavailable in general linearly ordered…

We analyze the pointwise convergence of a sequence of computable elements of L^1(2^omega) in terms of algorithmic randomness. We consider two ways of expressing the dominated convergence theorem and show that, over the base theory RCA_0,…

For a symmetric positive semidefinite linear system of equations $\mathcal{Q} {\bf x} = {\bf b}$, where ${\bf x} = (x_1,\ldots,x_s)$ is partitioned into $s$ blocks, with $s \geq 2$, we show that each cycle of the classical block symmetric…

In this paper we make a series of numerical experiments to support Greenberg's $p$-rationality conjecture, we present a family of $p$-rational biquadratic fields and we find new examples of $p$-rational multiquadratic fields. In the case of…