Related papers: Every braid admits a short sigma-definite represen…

Extending the notion of regularity introduced by Dickson in 1939, a positive definite ternary integral quadratic form is said to be spinor regular if it represents all the positive integers represented by its spinor genus (that is, all…

We give a complete classification of simple representations of the braid group B_3 with dimension $\leq 5$ over any algebraically closed f ield. In particular, we prove that a simple d-dimensional representation $\rho: B_3 \to GL(V)$ is…

We consider the problem of writing real polynomials as determinants of symmetric linear matrix polynomials. This problem of algebraic geometry, whose roots go back to the nineteenth century, has recently received new attention from the…

Let $A$ be an algebra over a commutative ring $k$. We prove that braidings on the category of $A$-bimodules are in bijective correspondence to canonical R-matrices, these are elements in $A\ot A\ot A$ satisfying certain axioms. We show that…

Bernardi has given a general formula for the number of regions of a deformation of the braid arrangement as a signed sum over boxed trees. We prove that each set of boxed trees which share an underlying (rooted labeled plane) tree…

We consider various decision problems for automatic semigroups, which involve the provision of an automatic structure as part of the problem instance. With mild restrictions on the automatic structure, which seem to be necessary to make the…

This paper represents a first attempt at unifying two promising models that attempt to explain the origin of the internal symmetries of leptons and quarks. It is shown that each of the four normed division algebras over the reals admits a…

It is shown that every $2$-shifted Poisson structure on a finitely generated semi-free commutative differential graded algebra $A$ defines a very explicit infinitesimal $2$-braiding on the homotopy $2$-category of the symmetric monoidal…

We show the inverse deformation problem has an affirmative answer: given a complete local noetherian ring $A$ with finite residue field $\pmb{k}$, we show that there is a topologically finitely generated profinite group $\Gamma$ and an…

We consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the $\Sigma_1$ theory is undecidable (already over two letters). We investigate the decidability…

We prove that any fusion category over $\mathbb{C}$ with exactly one non-invertible simple object is spherical. Furthermore, we classify all such categories that come equipped with a braiding.

In this paper we consider the following problems: how many different subsets of Sigma^n can occur as set of all length-n factors of a finite word? If a subset is representable, how long a word do we need to represent it? How many such…

A cofactor representation of an ideal element, that is, a representation in terms of the generators, can be considered as a certificate for ideal membership. Such a representation is typically not unique, and some can be a lot more…

We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…

We define geodesic normal forms for the general series of complex reflection groups G(de,e,n). This requires the elaboration of a combinatorial technique in order to determine minimal word representatives and to compute the length of the…

The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…

We prove a representation theorem for totally ordered idempotent monoids via a nested sum construction. Using this representation theorem we obtain a characterization of the subdirectly irreducible members of the variety of semilinear…

We prove that generic elements of braid groups are pseudo-Anosov, in the following sense: in the Cayley graph of the braid group with n $\ge$ 3 strands, with respect to Garside's generating set, we prove that the proportion of pseudo-Anosov…

We present an alternative account of the problem of classifying and finding normal forms for arbitrary bilinear forms. Beginning from basic results developed by Riehm, our solution to this problem hinges on the classification of…

A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ if and only if $(x,y)\in E$. A triangular grid graph is a subgraph of a tiling of the plane with…