Related papers: Minimum transformation representations of diagram …

The motion of a graph is the minimum number of vertices that are moved by a non-trivial automorphism. Equivalently, it can be defined as the minimal degree of its automorphism group (as a permutation group on the vertices). In this paper we…

The walled Brauer algebras $B_N(m,n)$ govern Schur--Weyl duality for unitary groups $U(N)$ acting on mixed tensor spaces $V_N^{\otimes m}\otimes \overline{V}_N^{\otimes n}$ and play an important role in applications ranging from AdS/CFT to…

We develop a unified representation theory for the categories of finite subsets and relation-preserving maps of highly homogeneous relational structures classified by Cameron. For any commutative coefficient ring $k$, we extend the…

We reinterpret ideas in Klein's paper on transformations of degree $11$ from the modern point of view of dessins d'enfants, and extend his results by considering dessins of type $(3,2,p)$ and degree $p$ or $p+1$, where $p$ is prime. In many…

We construct an L^2-model of "very small" irreducible unitary representations of simple Lie groups G which, up to finite covering, occur as conformal groups Co(V) of simple Jordan algebras V. If $V$ is split and G is not of type A_n, then…

We determine the smallest irreducible Brauer characters for finite quasi-simple orthogonal type groups in non-defining characteristic. Under some restrictions on the characteristic we also prove a gap result showing that the next larger…

In this paper we study the minimal faithful permutation representations of $SL_n(\mathbb F_q)$ and $GL_n(\mathbb F_q)$.

Polynomial representations of Boolean functions over various rings such as $\mathbb{Z}$ and $\mathbb{Z}_m$ have been studied since Minsky and Papert (1969). From then on, they have been employed in a large variety of fields including…

Usual termination proofs for a functional program require to check all the possible reduction paths. Due to an exponential gap between the height and size of such the reduction tree, no naive formalization of termination proofs yields a…

We study braid diagrams with a minimal number of crossings. Such braid diagrams correspond to geodesic words for the braid groups with standard Artin generators. We prove that a diagram of a homogeneous braid is minimal if and only if it is…

We provide a combinatorial description of the monoidal category generated by the fundamental representation of the small quantum group of $\mathfrak{sl}_2$ at a root of unity $q$ of odd order. Our approach is diagrammatic, and it relies on…

We study the partial Brauer monoid and its planar submonoid, the Motzkin monoid. We conduct a thorough investigation of the structure of both monoids, providing information on normal forms, Green's relations, regularity, ideals, idempotent…

Representations of Boolean functions by real polynomials play an important role in complexity theory. Typically, one is interested in the least degree of a polynomial p(x_1,...,x_n) that approximates or sign-represents a given Boolean…

We consider partitions of the edge set of a graph G into copies of a fixed graph H and single edges. Let \phi_H(n) denote the minimum number p such that any n-vertex G admits such a partition with at most p parts. We show that…

Let $f_1,\dots,f_k \in \mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an $n<x$ such that $\|f_i(n)\|\ll x^{-1/10.5kd(d-1)+o(1)}$ for all $1\le i\le k$. This improves on an earlier…

We study orbifolds by permutations of two identical N=2 minimal models within the Gepner construction of four dimensional heterotic strings. This is done using the new N=2 supersymmetric permutation orbifold building blocks we have recently…

In this paper we construct a class of bounded degree bipartite graphs with a small separator and large bandwidth. Furthermore, we also prove that graphs from this class are spanning subgraphs of graphs with minimum degree just slightly…

The catenary degree is an invariant that measures the distance between factorizations of elements within an atomic monoid. In this paper, we classify which finite subsets of $\mathbb Z_{\ge 0}$ occur as the set of catenary degrees of a…

Let $\vec{T}_k$ be the transitive tournament on $k$ vertices. We show that every oriented graph on $n=4m$ vertices with minimum total degree $(11/12+o(1))n$ can be partitioned into vertex disjoint $\vec{T}_4$'s, and this bound is…

In this paper we give presentations for the monoid $\mathcal{DP}_n$ of all partial isometries on $\{1,\ldots,n\}$ and for its submonoid $\mathcal{ODP}_n$ of all order-preserving partial isometries.