Related papers: A Well-Defined Jellyfish Algorithm for the Affine …
Graphical models and factor analysis are well-established tools in multivariate statistics. While these models can be both linked to structures exhibited by covariance and precision matrices, they are generally not jointly leveraged within…
Recently, a new structure called butterfly introduced by Perrin et at. is attractive for that it has very good cryptographic properties: the differential uniformity is at most equal to 4 and algebraic degree is also very high when exponent…
We give explicit actions of Drinfeld generators on Gelfand-Tsetlin bases of super Yangian modules associated with skew Young diagrams. In particular, we give another proof that these representations are irreducible. We study irreducible…
Aspects of the algebraic structure and representation theory of the quantum affine superalgebras with symmetrizable Cartan matrices are studied. The irreducible integrable highest weight representations are classified, and shown to be…
Automatic presentations, also called FA-presentations, were introduced to extend finite model theory to infinite structures whilst retaining the solubility of fundamental decision problems. This paper studies FA-presentable algebras. First,…
Using Stickelberger's theorem on Gauss sums, we show that if $F$ is a planar function on a finite field $\mathbb{F}_q$, then for all non-zero functions $G : \mathbb{F}_q \to \mathbb{F}_q$, we have \begin{equation*} d_{\mathsf{alg}}(G \circ…
In this paper, and a second part to follow, we complete the programme (initiated more than 15 years ago) of determining the decomposition numbers and verifying James' Conjecture for Iwahori--Hecke algebras of exceptional type. The new…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
Let $\mathcal U_\hbar(\hat{\mathfrak g})$ be the untwisted quantum affinization of a symmetrizable quantum Kac-Moody algebra $\mathcal U_\hbar({\mathfrak g})$. For $\ell\in\mathbb C$, we construct an $\hbar$-adic quantum vertex algebra…
Recently, Kronqvist et al.~\cite{KronqvistLundellWesterlund2016} rediscovered the supporting hyperplane algorithm of Veinott~\cite{Veinott1967} and demonstrated its computational benefits for solving convex mixed-integer nonlinear programs.…
We consider nonlinear recurrences generated from the iteration of maps that arise from cluster algebras. More precisely, starting from a skew-symmetric integer matrix, or its corresponding quiver, one can define a set of mutation…
In this article we consider the behavior in the vicinity of infinity of the class of all planar quadratic differential systems. This family depends on twelve parameters but due to action of the affine group and re-scaling of time the family…
The braid group appears in many scientific fields and its representations are instrumental in understanding topological quantum algorithms, topological entropy, classification of manifolds and so on. In this work, we study planer diagrams…
A split hypercomplex learning algorithm for the training of nonlinear finite impulse response adaptive filters for the processing of hypercomplex signals of any dimension is proposed. The derivation strictly takes into account the laws of…
In this paper, we consider a class of nonconvex and nonsmooth fractional programming problems, that involve the sum of a convex, possibly nonsmooth function composed with a linear operator and a differentiable, possibly nonconvex function…
In an upward planar 2-slope drawing of a digraph, edges are drawn as straight-line segments in the upward direction without crossings using only two different slopes. We investigate whether a given upward planar digraph admits such a…
It has been recently shown that any graph of genus g>0 can be stochastically embedded into a distribution over planar graphs, with distortion Olog (g+1)) [Sidiropoulos, FOCS 2010]. This embedding can be computed in polynomial time, provided…
In this paper we construct strong exceptional collections of vector bundles on smooth projective varieties that have a prescribed endomorphism algebra. We prove the construction problem always have a solution. We consider some applications…
We shall present an algorithm for determining whether or not a given planar graph H can ever be a subgraph of a 4-regular planar graph. The algorithm has running time O(|H|^{2.5}) and can be used to find an explicit 4-regular planar graph G…
That finite-dimensional simple Lie algebras over the complex numbers can be classified by means of purely combinatorial and geometric objects such as Coxeter-Dynkin diagrams and indecomposable irreducible root systems, is arguably one of…