相关论文: A constructive algorithm for the Cartan decomposit…
By means of a generalization of the Maurer-Cartan expansion method we construct a procedure to obtain expanded higher-order Lie algebras. The expanded higher order Maurer-Cartan equations for the case $\mathcal{G}=V_{0}\oplus V_{1}$ are…
A numerical algorithm to decompose an exact low-rank skew-symmetric tensor into a sum of elementary (rank-$1$) skew-symmetric tensors is introduced. The algorithm uncovers this Grassmann decomposition based on linear relations that are…
In this paper, we will describe a new factorization algorithm based on the continuous representation of Gauss sums, generalizable to orders j>2. Such an algorithm allows one, for the first time, to find all the factors of a number N in a…
In this paper we develop techniques that eliminate the need of the Generalized Riemann Hypothesis (GRH) from various (almost all) known results about deterministic polynomial factoring over finite fields. Our main result shows that given a…
We analyze the decomposition problem of multivariate polynomial-exponential functions from truncated series and present new algorithms to compute their decomposition. Using the duality between polynomials and formal power series, we first…
In Part I of this series we described three algorithms that construct canonical tree-decompositions of graphs which distinguish all their k-blocks and tangles of order k. We now establish bounds on the number of parts in these…
Certifying the positivity of trigonometric polynomials is of first importance for design problems in discrete-time signal processing. It is well known from the Riesz-Fej\'ez spectral factorization theorem that any trigonometric univariate…
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…
We use the structure lattice, introduced in Part I, to undertake a systematic study of the class $\mathscr S$ consisting of compactly generated, topologically simple, totally disconnected locally compact groups that are non-discrete. Given…
In this paper we consider the problem of deformation quantization of the algebra of polynomial functions on coadjoint orbits of semisimple lie groups. The deformation of an orbit is realized by taking the quotient of the universal…
We construct a class of II_1 factors M that admit unclassifiably many Cartan subalgebras in the sense that the equivalence relation of being conjugate by an automorphism of M is complete analytic, in particular non Borel. We also construct…
In this paper, we calculate the Jordan decomposition (or say, the Jordan canonical form) for a class of non-symmetric Ornstein-Uhlenbeck operators with the drift coefficient matrix being a Jordan block and the diffusion coefficient matrix…
The element |V_{ub}| of the quark mixing matrix can be extracted with small theoretical uncertainties by combining weighted integrals over the endpoint regions of the lepton spectrum in B -> X_u l nu decays and the photon spectrum in B ->…
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…
Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…
Starting from the Lehmann-Symanzik-Zimmermann reduction theorem, we provide a general procedure to extract S-matrix elements from Green functions in arbitrary renormalization schemes.
Recently $C^m$-conforming finite elements on simplexes in arbitrary dimension are constructed by Hu, Lin and Wu. The key in the construction is a non-overlapping decomposition of the simplicial lattice in which each component will be used…
In a previous paper (math-ph/0202002) an Euler angle parameterization for SU(4) was given. Here we present the derivation of a generalized Euler angle parameterization for SU(N). The formula for the calculation of the Haar measure for SU(N)…
Let $K:={x: g(x)\leq 1}$ be the compact sub-level set of some homogeneous polynomial $g$. Assume that the only knowledge about $K$ is the degree of $g$ as well as the moments of the Lebesgue measure on $K$ up to order 2d. Then the vector of…
To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…