Zobrazeno 1 - 10
of 130
pro vyhledávání: '"Houston, Robin"'
Publikováno v:
Combinator. Probab. Comp. 33 (2024) 769-794
We present a new explicit formula for the determinant that contains superexponentially fewer terms than the usual Leibniz formula. As an immediate corollary of our formula, we show that the tensor rank of the $n \times n$ determinant tensor is no lar
Externí odkaz:
http://arxiv.org/abs/2301.06586
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Greenwald, Rachel Paige, Childs, Lana, Pachón, Helena, Timmer, Arnold, Houston, Robin, Codling, Karen *
Publikováno v:
In Current Developments in Nutrition August 2022 6(8)
Autor:
Heijltjes, Willem, Houston, Robin
Publikováno v:
Logical Methods in Computer Science, Volume 12, Issue 1 (March 2, 2016) lmcs:1625
MLL proof equivalence is the problem of deciding whether two proofs in multiplicative linear logic are related by a series of inference permutations. It is also known as the word problem for star-autonomous categories. Previous work has shown the pro
Externí odkaz:
http://arxiv.org/abs/1510.06178
Autor:
Houston, Robin
A superpermutation on $n$ symbols is a string that contains each of the $n!$ permutations of the $n$ symbols as a contiguous substring. The shortest superpermutation on $n$ symbols was conjectured to have length $\sum_{i=1}^n i!$. The conjecture had
Externí odkaz:
http://arxiv.org/abs/1408.5108
Autor:
Houston, Robin
We study categorical models for the unitless fragment of multiplicative linear logic. We find that the appropriate notion of model is a special kind of promonoidal category. Since the theory of promonoidal categories has not been developed very thoro
Externí odkaz:
http://arxiv.org/abs/1305.2231
Zen Puzzle Garden (ZPG) is a one-player puzzle game. In this paper, we prove that deciding the solvability of ZPG is NP-complete.
Comment: Submitted
Comment: Submitted
Externí odkaz:
http://arxiv.org/abs/1106.2104
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Houston, Robin
Publikováno v:
Journal of Pure and Applied Algebra, Volume 212, Issue 2, February 2008, Pages 394-400
If a compact closed category has finite products or finite coproducts then it in fact has finite biproducts, and so is semi-additive.
Comment: 9 pages. Introduction further expanded, minor errors corrected
Comment: 9 pages. Introduction further expanded, minor errors corrected
Externí odkaz:
http://arxiv.org/abs/math/0604542
We describe a notion of categorical model for unitless fragments of (multiplicative) linear logic. The basic definition uses promonoidal categories, and we also give an equivalent elementary axiomatisation.
Comment: 23 pages
Comment: 23 pages
Externí odkaz:
http://arxiv.org/abs/math/0504037