Related papers: Functional Decomposition using Principal Subfields

Let $G$ be a direct product of inner forms of general linear groups over non-archimedean locally compact fields of residue characteristic $p$ and let $K^1$ be the pro-$p$-radical of a maximal compact open subgroup of $G$. In this paper we…

It is well-known that GADTs do not admit standard map functions of the kind supported by ADTs and nested types. In addition, standard map functions are insufficient to distribute their data-changing argument functions over all of the…

We develop explicit formulas and algorithms for arithmetic in radical function fields K/k(x) over finite constant fields. First, we classify which places of k(x) whose local integral bases have an easy monogenic form, and give explicit…

Let $\mathfrak{g}$ be a simple complex Lie algebra and let $\mathfrak{t} \subset \mathfrak{g}$ be a toral subalgebra of $\mathfrak{g}$. As a $\mathfrak{t}$-module $\mathfrak{g}$ decomposes as \[\mathfrak{g} = \mathfrak{s} \oplus…

A subset $M \subset \textbf{R}^3$ is called a \emph{basic subset}, if for any funciton $f \colon M \to \textbf{R}$ there exist such functions $f_1; f_2; f_3 \colon \textbf{R} \to \textbf{R}$ that $f(x_1, x_2, x_3) = f_1(x_1) + f_2(x_2) +…

We study the Potts model (defined geometrically in the cluster picture) on finite two-dimensional lattices of size L x N, with boundary conditions that are free in the L-direction and periodic in the N-direction. The decomposition of the…

The classical Ritt's Theorems state several properties of univariate polynomial decomposition. In this paper we present new counterexamples to Ritt's first theorem, which states the equality of length of decomposition chains of a…

In this work we describe an efficient implementation of a hierarchy of algorithms for the decomposition of dense matrices over the field with two elements (GF(2)). Matrix decomposition is an essential building block for solving dense…

We describe the Median K-Flats (MKF) algorithm, a simple online method for hybrid linear modeling, i.e., for approximating data by a mixture of flats. This algorithm simultaneously partitions the data into clusters while finding their…

We extend the decomposition conjecture to 2d quantum field theories with a gauged $\text{Rep}(H)$ symmetry category for $H$ a finite-dimensional semisimple Hopf algebra with $\text{Rep}(G)$ trivially-acting and $\text{Vec}(\Gamma)$ the…

This note is purely expository. In the course of the Kolmogorov-Arnold solution of Hilbert's 13th problem on superpositions there appeared the notion of basic embedding. A subset K of R^2 is basic if for each continuous function f:K->R…

Let h be a complex meromorphic function decomposed in two different ways P(f) and Q(g), where f, g are meromorphic functions and P, Q are rational functions. We follow an approach due to C.-C. Yang, P. Li and K. H. Ha who handle similar…

We show that the Hausdorffized algebraic K-theory of a C*-algebra decomposes naturally as a direct sum of the Hausdorffized unitary algebraic K-theory and the space of continuous affine functions on the trace simplex. Under mild regularity…

We give a simple and natural method for computing approximately optimal solutions for minimizing a convex function $f$ over a convex set $K$ given by a separation oracle. Our method utilizes the Frank--Wolfe algorithm over the cone of valid…

We define a notion of formal quantum field theory and associate a formal quantum field theory to K-theoretical intersection theories on Hilbert schemes of points on algebraic surfaces. This enables us to find an effective way to compute…

Let $K$ be the number field determined by a monic irreducible polynomial $f(x)$ with integer coefficients. In previous papers we parameterized the prime ideals of $K$ in terms of certain invariants attached to Newton polygons of higher…

Let ${\cal G}$ be a minor-closed graph class and let $G$ be an $n$-vertex graph. We say that $G$ is a $k$-apex of ${\cal G}$ if $G$ contains a set $S$ of at most $k$ vertices such that $G\setminus S$ belongs to ${\cal G}$. Our first result…

We present a fast randomized algorithm that computes a low rank LU decomposition. Our algorithm uses random projections type techniques to efficiently compute a low rank approximation of large matrices. The randomized LU algorithm can be…

A fast non-convex low-rank matrix decomposition method for potential field data separation is proposed. The singular value decomposition of the large size trajectory matrix, which is also a block Hankel matrix, is obtained using a fast…

We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.