Related papers: Functional Decomposition using Principal Subfields

For a polynomial map $\mathbf{f} : k^n \to k^m$ ($k$ a field), we investigate those polynomials $g \in k[t_1,\ldots, t_n]$ that can be written as a composition $g = h \circ \mathbf{f}$, where $h: k^m \to k$ is an arbitrary function. In the…

We obtain two new algorithms for partial fraction decompositions; the first is over algebraically closed fields, and the second is over general fields. These algorithms takes $O(M^2)$ time, where $M$ is the degree of the denominator of the…

Let $K$ be an algebraically closed field of characteristic zero, and let $\mathcal{K} := K(t)$ be the rational function field over $K$. For each $d \ge 2$, we consider the unicritical polynomial $f_d(z) := z^d + t \in \mathcal{K}[z]$, and…

A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…

Let G be a simple complex algebraic group and let K be a reductive subgroup of G such that the coordinate ring of G/K is a multiplicity free G-module. We consider the G-algebra structure of C[G/K], and study the decomposition into…

Motivated by the wide-ranging applications of Hamiltonian decompositions in distributed computing, coded caching, routing, resource allocation, load balancing, and fault tolerance, our work presents a comprehensive design for Hamiltonian…

We present an algorithm producing all rational functions $f$ with prescribed $n+1$ Taylor coefficients at the origin and such that $\|f\|_\infty\le 1$ and $\deg f\le k$ for every fixed $k\ge n$. The case where $k<n$ is also discussed.

The aim of this work is to develop a fast algorithm for approximating the matrix function $f(A)$ of a square matrix $A$ that is symmetric and has hierarchically semiseparable (HSS) structure. Appearing in a wide variety of applications,…

We generalize classical kinematic formulas for convex bodies in a real vector space $V$ to the setting of non-compact Lie groups admitting a Cartan decomposition. Specifically, let $G$ be a closed linear group with Cartan decomposition $G…

It is well known by analysts that a concept lattice has an exponential size in the data. Thus, as soon as he works with real data, the size of the concept lattice is a fundamental problem. In this chapter, we propose to investigate factor…

Hypergraphs, increasingly utilised to model complex and diverse relationships in modern networks, have gained significant attention for representing intricate higher-order interactions. Among various challenges, cohesive subgraph discovery…

Functional decomposition is the process of breaking down a function $f$ into a composition $f=g(f_1,\dots,f_k)$ of simpler functions $f_1,\dots,f_k$ belonging to some class $\mathcal{F}$. This fundamental notion can be used to model…

A finite number of rational functions are compatible if they satisfy the compatibility conditions of a first-order linear functional system involving differential, shift and q-shift operators. We present a theorem that describes the…

We investigate finite sets of rational functions $\{ f_{1},f_{2}, \dots, f_{r} \}$ defined over some number field $K$ satisfying that any $t_{0} \in K$ is a $K_{p}$-value of one of the functions $f_{i}$ for almost all primes $p$ of $K$. We…

We give a simple characterization of the highest weight vertices in the crystal graph of the level l Fock spaces. This characterization is based on the notion of totally periodic symbols viewed as affine analogues of reverse lattice words…

This article investigates $k$-regular factorizations of characteristic functions associated with completely non-coisometric row contractions. In this setting, a one-to-one correspondence is established between chains of joint invariant…

Noncommutative rational functions, i.e., elements of the universal skew field of fractions of a free algebra, can be defined through evaluations of noncommutative rational expressions on tuples of matrices. This interpretation extends their…

This paper presents no new results; its goals are purely pedagogical. A special case of the Cartan Decomposition has found much utility in the field of quantum computing, especially in its sub-field of quantum compiling. This special case…

Let $K$ be a compact, centrally-symmetric, strictly-convex region in ${\mathbb R}^3$, which is a semi-algebraic set of constant complexity, i.e. the unit ball of a corresponding metric, denoted as $\|\cdot\|_K$. Let ${\mathcal{K}}$ be a set…

We consider the operation of intersecting with a locally principal Cartier divisor (i.e., a Cartier divisor which is principal on some neighborhood of its support). We describe this operation explicitly on the level of cycles and rational…