Related papers: An optimal representation for the trace zero subgr…
In this work we generalise the main result of arXiv:1812.05651 to the family of hyperelliptic curves with potentially good reduction over a $p$-adic field which have degree $p$ and the largest possible image of inertia under the $\ell$-adic…
Various semigroups of noninvertible supermatrices of the special (antitriangle) shape having nilpotent Berezinian which appear in supersymmetric theories are defined and investigated. A subset of them continuously represents left and right…
The representation category $\mathcal{A} = Rep(G,\epsilon)$ of a supergroup scheme $G$ has a largest proper tensor ideal, the ideal $\mathcal{N}$ of negligible morphisms. If we divide $\mathcal{A}$ by $\mathcal{N}$ we get the semisimple…
We develop a theory of representations of (discrete) polymatroids over tracts in terms of Pl\"ucker coordinates and suitable Pl\"ucker relations. As special cases, we recover polymatroids themselves as polymatroid representations over the…
We give a new general technique for constructing and counting number fields with an ideal class group of nontrivial m-rank. Our results can be viewed as providing a way of specializing the Picard group of a variety V over $\mathbb{Q}$ to…
Tensor decomposition has emerged as a prominent technique to learn low-dimensional representation under the supervision of reconstruction error, primarily benefiting data inference tasks like completion and imputation, but not…
Building on prior work, we analyze the decomposition of the restriction of an irreducible representation of SL_2(k), for k a p-adic field of odd residual characteristic, to a maximal compact subgroup K. The pattern of the decomposition…
We propose a new approach to graph compression by appeal to optimal transport. The transport problem is seeded with prior information about node importance, attributes, and edges in the graph. The transport formulation can be setup for…
Let $\mathbf{G}$ be an algebraic group over a local field $\mathbf k$ of characteristic zero. We show that the locally compact group $\mathbf G(\mathbf k)$ consisting of the $\mathbf k$-rational points of $\mathbf G$ is of type I. Moreover,…
This paper addresses the problem of finding a representation of a subtree distance, which is an extension of the tree metric. We show that a minimal representation is uniquely determined by a given subtree distance, and give a linear time…
We prove formulas for power moments for point counts of elliptic curves over a finite field $k$ such that the groups of $k$-points of the curves contain a chosen subgroup. These formulas express the moments in terms of traces of Hecke…
In this paper we discuss various aspects of the problem of determining the minimal dimension of an injective linear representation of a finite semigroup over a field. We outline some general techniques and results, and apply them to…
This paper describes the adaptation of a well-scaling parallel algorithm for computing Morse-Smale segmentations based on path compression to a distributed computational setting. Additionally, we extend the algorithm to efficiently compute…
Graph reordering is a powerful technique to increase the locality of the representations of graphs, which can be helpful in several applications. We study how the technique can be used to improve compression of graphs and inverted indexes.…
In this paper we investigate the optimal partition approach for multiparametric conic linear optimization (mpCLO) problems in which the objective function depends linearly on vectors. We first establish more useful properties of the…
In its most general form, the optimal transport problem is an infinite-dimensional optimization problem, yet certain notable instances admit closed-form solutions. We identify the common source of this tractability as \textit{symmetry} and…
Dimensionality reduction, cluster analysis, and sparse representation are basic components in machine learning. However, their relationships have not yet been fully investigated. In this paper, we find that the spectral graph theory…
An algorithm for solving nonconvex smooth optimization problems is proposed, analyzed, and tested. The algorithm is an extension of the Trust Region Algorithm with Contractions and Expansions (TRACE) [Math. Prog. 162(1):132, 2017]. In…
We present a compressed representation of tries based on top tree compression [ICALP 2013] that works on a standard, comparison-based, pointer machine model of computation and supports efficient prefix search queries. Namely, we show how to…
We develop further the techniques presented in [M. Mombelli. On the tensor product of bimodule categories over Hopf algebras. Preprint arXiv:1111.1610 ] to study bimodule categories over the representation categories of arbitrary…