Related papers: Advanced Computer Algebra for Determinants
We give a proof of Ollinger's conjecture that the problem of tiling the plane with translated copies of a set of $8$ polyominoes is undecidable. The techniques employed in our proof include a different orientation for simulating the Wang…
By holonomic guessing, we denote the process of finding a linear differential equation with polynomial coefficients satisfied by the generating function of a sequence, for which only a few first terms are known. Holonomic guessing has been…
There has recently been work by multiple groups in extracting the properties associated with cardinal invariants of the continuum and translating these properties into similar analogous combinatorial properties of computational oracles.…
Consider $\alpha \in \Q(i)$ satisfying $|\alpha| >1$. Let $\D = \{0,1,\ldots,|a_0|-1\}$, where $a_0$ is the independent coefficient of the minimal primitive polynomial of $\alpha$. We introduce a way of expanding complex numbers in base…
Term algebras are important objects in computer science and are correspondingly well-studied. A natural generalization is to quotient these algebras by finitely many ground term equations, obtaining what we call almost free algebras. One of…
We give an introduction to some of the recent ideas that go under the name "geometric complexity theory". We first sketch the proof of the known upper and lower bounds for the determinantal complexity of the permanent. We then introduce the…
The master theorem, introduced by Richter-Gebert and generalized by Fomin and the first author, provides a method for proving incidence theorems of projective geometry using triangular tilings of surfaces. We investigate which incidence…
We give algorithms for the computation of the algebraic de Rham cohomology of open and closed algebraic sets inside projective space or other smooth complex toric varieties. The methods, which are based on Gr\"obner basis computations in…
In this article, which is dedicated to my friend and colleague Boris Zilber on the occasion of his 75th birthday, I put forward a strategy for proving his quasiminimality conjecture for the complex exponential field. That is, for showing…
The purpose of this paper is to compute the asymptotics of determinants of finite sections of operators that are trace class perturbations of Toeplitz operators. For example, we consider the asymptotics in the case where the matrices are of…
We show how to count tilings of Aztec diamonds and hexagons with defects using determinants. In several cases these determinants can be evaluated in closed form. In particular, we obtain solutions to problems 1, 2, and 10 in James Propp's…
This is an appendix to the Handbook of Tilting Theory, edited by Angeleri-Huegel, Happel and Krause, to be published soon. Part 1 of the appendix provides an outline of the core of tilting theory. Part 2 is devoted to topics where tilting…
Kaltofen has proposed a new approach in 1992 for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Krylov subspaces, and computes the determinant as the constant term of a…
It is known that determinantal point processes have an intimate relation to operator algebras. In the paper, we extend this relationship to encompass dynamical aspects. Especially, we delve into two types of determinantal point processes.…
Compositionality is a key property for dealing with complexity, which has been studied from many points of view in diverse fields. Particularly, the composition of individual computations (or programs) has been widely studied almost since…
Results of Koebe (1936), Schramm (1992), and Springborn (2005) yield realizations of $3$-polytopes with edges tangent to the unit sphere. Here we study the algebraic degrees of such realizations. This initiates the research on constrained…
We resolve three long-standing open problems, namely the (algorithmic) decidability of network coding, the decidability of conditional information inequalities, and the decidability of conditional independence implication among random…
We provide a new foundation for combinatorial commutative algebra and Stanley-Reisner theory using the partition complex introduced in [Adi18]. One of the main advantages is that it is entirely self-contained, using only a minimal knowledge…
We investigate determinants of random unitary pencils (with scalar or matrix coefficients), which generalize the characteristic polynomial of a single unitary matrix. In particular we examine moments of such determinants, obtained by…
In this paper we settle a weak version of a conjecture (i.e. Conjecture 6) by Mills, Robbins and Rumsey in the paper "Self-complementary totally symmetric plane partitions" (J. Combin. Theory Ser. A 42, 277-292). In other words we show that…