Related papers: Computer Bounds for Kronheimer-Mrowka Foam Evaluat…
Via large and small $N_c$ relations we derive nonperturbative results about the conformal window of two-index theories. Using Schwinger-Dyson methods as well as four-loops results we estimate subleading corrections and show that naive large…
In 2003, Alladi, Andrews and Berkovich proved an identity for partitions where parts occur in eleven colors: four primary colors, six secondary colors, and one quaternary color. Their work answered a longstanding question of how to go…
We give a brief report on our computations of linear determinantal representations of smooth plane cubics over finite fields. After recalling a classical interpretation of linear determinantal representations as rational points on the…
We consider $d$-dimensional configurations, that is, colorings of the $d$-dimensional integer grid $\mathbb{Z}^d$ with finitely many colors. Moreover, we interpret the colors as integers so that configurations are functions $\mathbb{Z}^d…
We consider $(k,j)$-colored partitions, partitions in which $k$ colors exist but at most $j$ colors may be chosen per size of part. In particular these generalize overpartitions. Advancing previous work, we find new congruences, including…
A multi-way factor analysis model is introduced for tensor-variate data of any order. Each data item is represented as a (sparse) sum of Kruskal decompositions, a Kruskal-factor analysis (KFA). KFA is nonparametric and can infer both the…
$O(n) \times O(m)$ symmetric Landau-Ginzburg models in $d=3$ dimension possess a rich structure of the renormalization group and its understanding offers a theoretical prediction of the phase diagram in frustrated spin models with…
Beginning with the projectively invariant method for linear programming, interior point methods have led to powerful algorithms for many difficult computing problems, in combinatorial optimization, logic, number theory and non-convex…
This paper contains three related groupings of results. First, we consider a new notion of an admissible skein module of a surface associated to an ideal in a (non-semisimple) pivotal category. Second, we introduce the notion of a chromatic…
We introduce the notion of "color rules" for computing class functions of $Z_k \wr S_n$, where $Z_k$ is the cyclic group of order $k$ and $S_n$ is the symmetric group on $n$ letters. Using a general sign-reversing involution and a map of…
If $X$ is a projective, geometrically irreducible variety defined over a finite field $\F_q$, such that it is smooth and its Chow group of 0-cycles fulfills base change, i.e. $CH_0(X\times_{\F_q}\bar{\F_q(X)})=\Q$, then the second author's…
Ramsey's theorem asserts that every $k$-coloring of $[\omega]^n$ admits an infinite monochromatic set. Whenever $n \geq 3$, there exists a computable $k$-coloring of $[\omega]^n$ whose solutions compute the halting set. On the other hand,…
The aim of this paper is to contribute to a better conceptual understanding of gauge quantum field theories, such as quantum chromodynamics, by discussing a famous physical limit, the 't Hooft limit, in which the theory concerned often…
The K\"unneth formula is one of the basic tools for computing cohomology. Its validity for foliated cohomology, that is, for the tangential de Rham cohomology of a foliated manifold, is investigated. The main difficulty encountered is the…
We give two algorithms to compute linear determinantal representations of smooth plane curves of any degree over any field. As particular examples, we explicitly give representatives of all equivalence classes of linear determinantal…
In this paper, we present a geometric description of foams, which are prevalent in topological quantum field theories (TQFTs) based on quantum algebra, and reciprocally explore the geometry of Rozansky-Witten (RW) theory from an algebraic…
We consider proper online colorings of hypergraphs defined by geometric regions. We prove that there is an online coloring algorithm that colors $N$ intervals of the real line using $\Theta(\log N/k)$ colors such that for every point $p$,…
In this paper we have shown without assuming the four color theorem of planar graphs that every (bridgeless) cubic planar graph has a three-edge-coloring. This is an old-conjecture due to Tait in the squeal of efforts in settling the…
Let $(\Sigma,p)$ be a pointed Riemann surface of genus $g\geq 1$. For any integer $k\geq 1$, we parametrize the space of meromorphic quadratic differentials on $\Sigma$ with a pole of order $(k+2)$ at $p$, having a connected critical graph…
This investigation studies the decidability problem of plane edge coloring with three symbols. In the edge coloring (or Wang tiles) of a plane, unit squares with colored edges that have one of $p$ colors are arranged side by side such that…