English
Related papers

Related papers: Optimal spinor selectivity for quaternion Bass ord…

200 papers

It has been shown by Indyk and Sidiropoulos [IS07] that any graph of genus g>0 can be stochastically embedded into a distribution over planar graphs with distortion 2^O(g). This bound was later improved to O(g^2) by Borradaile, Lee and…

Computational Geometry · Computer Science 2010-05-24 Anastasios Sidiropoulos

We study the problem of finding orthogonal low-rank approximations of symmetric tensors. In the case of matrices, the approximation is a truncated singular value decomposition which is then symmetric. Moreover, for rank-one approximations…

Numerical Analysis · Mathematics 2019-06-18 Oscar Mickelin , Sertac Karaman

We study the computational complexity of approximately computing the partition function of a spin system. Techniques based on standard counting-to-sampling reductions yield $\tilde{O}(n^2)$-time algorithms, where $n$ is the size of the…

Data Structures and Algorithms · Computer Science 2026-04-03 Xiaoyu Chen , Zongchen Chen , Kuikui Liu , Xinyuan Zhang

We complete all local spinor norm computations for quaternionic skew-hermitian forms over the field of rational numbers. Examples of class number computations are provided.

Number Theory · Mathematics 2013-06-21 L. E. Arenas-Carmona , P. Quiroz

This article aims to contribute to the study of algebras with triangular decomposition over a Hopf algebra, as well as the BGG Category O. We study functorial properties of O across various setups. The first setup is over a skew group ring,…

Representation Theory · Mathematics 2015-02-02 Apoorva Khare

In this paper, we study the fundamental open question of finding the optimal high-order algorithm for solving smooth convex minimization problems. Arjevani et al. (2019) established the lower bound $\Omega\left(\epsilon^{-2/(3p+1)}\right)$…

Optimization and Control · Mathematics 2022-05-20 Dmitry Kovalev , Alexander Gasnikov

We study the problem of supporting queries on a string $S$ of length $n$ within a space bounded by the size $\gamma$ of a string attractor for $S$. Recent works showed that random access on $S$ can be supported in optimal…

Data Structures and Algorithms · Computer Science 2018-12-24 Nicola Prezza

In this paper, we present an algorithm to compute a basis of the space of algebraic modular forms on the maximal order of the definite quaternion algebra of discriminant $2$, and provide a database of such bases. One of our motivations is…

Number Theory · Mathematics 2024-06-04 Hiroyuki Ochiai , Satoshi Wakatsuki , Shun'ichi Yokoyama

We give an algorithm to explicitly compute the largest subtree, in the local Bruhat-Tits tree for PSL_2(k), whose vertices correspond to orders containing a given suborder H, in terms of a set of generators for H. The shape of this subtree…

Number Theory · Mathematics 2014-07-29 Luis Arenas-Carmona , Ignacio Saavedra

A necessary and sufficient condition for fractional Orlicz-Sobolev spaces to be continuously embedded into $L^\infty(\mathbb R^n)$ is exhibited. Under the same assumption, any function from the relevant fractional-order spaces is shown to…

Functional Analysis · Mathematics 2022-07-22 Angela Alberico , Andrea Cianchi , Luboš Pick , Lenka Slavíková

Two themes drive this article: identifying the structure necessary to formulate quaternionic operator theory and revealing the relation between complex and quaternionic operator theory. The theory of quaternionic right linear operators is…

Spectral Theory · Mathematics 2018-03-29 Jonathan Gantner

Let $d$ and $m$ be two distinct squarefree integers and $\mathcal{O}_K$ the ring of integers of the quadratic field $K=\mathbb{Q}(\sqrt{d})$. Denote by $ H_K(\alpha, m)$ a quaternion algebra over $K$, where $\alpha\in \mathcal{O}_K$. In…

Number Theory · Mathematics 2019-06-27 Vincenzo Acciaro , Diana Savin , Mohammed Taous , Abdelkader Zekhnini

In this paper, we study the problem of inference in high-order structured prediction tasks. In the context of Markov random fields, the goal of a high-order inference task is to maximize a score function on the space of labels, and the…

Machine Learning · Computer Science 2023-10-23 Chuyang Ke , Jean Honorio

Let $\cO$ be a maximal order in a definite quaternion algebra over $\mathbb{Q}$ of prime discriminant $p$, and $\ell$ a small prime. We describe a probabilistic algorithm, which for a given left $O$-ideal, computes a representative in its…

Number Theory · Mathematics 2014-06-05 David Kohel , Kristin Lauter , Christophe Petit , Jean-Pierre Tignol

All possible permutations in the discrete $S_4$ group are classified by three rotation angles associated with the orthogonal group $O(3)$. We construct a spinor representation ${\bf 2}_D$ of $O(3)$, which is transformed by three 4$\times$4…

High Energy Physics - Phenomenology · Physics 2019-01-29 Teruyuki Kitabayashi , Masaki Yasuè

Using the complete orthonormal sets of radial parts of nonrelativitistic exponential type orbitals (2,1, 0, 1, 2, ...) and spinor type tensor spherical harmonics of rank s the new formulae for the 2(2s+1)-component relativistic spinors…

Mathematical Physics · Physics 2015-03-13 I. I. Guseinov

Given a monogenic function on the quaternionic algebra $\mathbb{H}$, the Clifford algebra $\mathbb{R}_n$ or the octonionic algebra $\mathbb{O}$ we prove that $|\nabla^m f|^\alpha$ is subharmonic for some $\alpha>0$ where $\nabla^m f$ is the…

Complex Variables · Mathematics 2021-04-12 Luca Baracco , Stefano Pinton

We provide a nontrivial bound on the rank of any tensor $T$ over the quaternions $\mathbb{H}$ in the $n_1\times n_2\times n_3$ cases where $2\leq n_i\leq 3$. We describe a decomposition of $T$ into $3$ simple tensors in the $2\times 2\times…

Rings and Algebras · Mathematics 2021-03-04 YG Liang , Sergio Da Silva , Yang Zhang

In the tensor completion problem, one seeks to estimate a low-rank tensor based on a random sample of revealed entries. In terms of the required sample size, earlier work revealed a large gap between estimation with unbounded computational…

Data Structures and Algorithms · Computer Science 2016-12-26 Andrea Montanari , Nike Sun

We construct orthogonal arrays OA$_{\lambda} (k,n)$ (of strength two) having a row that is repeated $m$ times, where $m$ is as large as possible. In particular, we consider OAs where the ratio $m / \lambda$ is as large as possible; these…

Combinatorics · Mathematics 2018-12-14 Charles J. Colbourn , Douglas R. Stinson , Shannon Veitch
‹ Prev 1 4 5 6 7 8 10 Next ›