English
Related papers

Related papers: Partial fraction decompositions and an algorithm f…

200 papers

We present a polynomiality property of the Littlewood-Richardson coefficients c_{\lambda\mu}^{\nu}. The coefficients are shown to be given by polynomials in \lambda, \mu and \nu on the cones of the chamber complex of a vector partition…

Combinatorics · Mathematics 2007-05-23 Etienne Rassart

Tensor rank and low-rank tensor decompositions have many applications in learning and complexity theory. Most known algorithms use unfoldings of tensors and can only handle rank up to $n^{\lfloor p/2 \rfloor}$ for a $p$-th order tensor in…

Data Structures and Algorithms · Computer Science 2015-04-23 Rong Ge , Tengyu Ma

The present paper is a continuation of our work [11], where we introduced a fractional operator calculus related to a fractional ${\psi}-$Fueter operator in the one-dimensional Riemann-Liouville derivative sense in each direction of the…

Complex Variables · Mathematics 2022-09-27 José Oscar González-Cervantes , Juan Bory-Reyes

In this paper, we give a detailed account of the algorithm outlined in [1] for Feynman integral reduction and $\varepsilon$-factorised differential equations. The algorithm consists of two steps. In the first step, we use a new geometric…

Partition function of beta-gamma systems on the orbifolds C^2/Z_N and C^3/Z_M x Z_N are obtained as the invariant part of that on the respective affine spaces, by lifting the geometric action of the orbifold group to the fields.…

High Energy Physics - Theory · Physics 2015-06-17 Chandrasekhar Bhamidipati , Koushik Ray

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…

Combinatorics · Mathematics 2007-05-23 S. Gao , A. G. B. Lauder

An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained…

Optimization and Control · Mathematics 2009-12-10 William Hager , Dzung Phan , Hongchao Zhang

Taking partial traces for computing reduced density matrices, or related functions, is a ubiquitous procedure in the quantum mechanics of composite systems. In this article, we present a thorough description of this function and analyze the…

Quantum Physics · Physics 2016-08-25 Jonas Maziero

We give a new framework for proving the existence of low-degree, polynomial approximators for Boolean functions with respect to broad classes of non-product distributions. Our proofs use techniques related to the classical moment problem…

Computational Complexity · Computer Science 2013-01-07 Adam Klivans , Raghu Meka

Some important applicative problems require the evaluation of functions $\Psi$ of large and sparse and/or \emph{localized} matrices $A$. Popular and interesting techniques for computing $\Psi(A)$ and $\Psi(A)\mathbf{v}$, where $\mathbf{v}$…

Numerical Analysis · Mathematics 2022-04-25 Daniele Bertaccini , Marina Popolizio , Fabio Durastante

This work proposes a conformable fractional predictor-corrector algorithm for solving conformable fractional differential equations. Fractional calculus is finding applications in various scientific fields, but existing numerical methods…

Numerical Analysis · Mathematics 2024-06-25 Mohamed Echchehira , Youness Assebbane , Mustapha Atraoui , Mohamed Bouaouid

We prove identities generating higher dimensional vector partitions. We derive theorems for integer lattice points in the 2D first quadrant, then generalize the approach to find 3D and $n$-space lattice point vector region extensions. We…

Combinatorics · Mathematics 2023-02-03 Geoffrey B. Campbell

This paper deals with the partition function of the Ising model from statistical mechanics, which is used to study phase transitions in physical systems. A special case of interest is that of the Ising model with constant energies and…

Computational Complexity · Computer Science 2012-10-15 Tomer Kotek

We obtain an asymptotic formula for the partition function of the six-vertex model with partial domain wall boundary conditions in the ferroelectric phase region. The proof is based on a formula for the partition function involving the…

Mathematical Physics · Physics 2015-02-23 Pavel Bleher , Karl Liechty

In this thesis, a new approach for constructing subdivision algorithms for generalized quadratic and cubic B-spline subdivision for subdivision surfaces and volumes is presented. First, a catalog of quality criteria for these subdivision…

Computational Geometry · Computer Science 2025-07-29 Alexander Dietz

Despite there being significant work on developing spectral, and metric embedding based approximation algorithms for hypergraph generalizations of conductance, little is known regarding the approximability of hypergraph partitioning…

Data Structures and Algorithms · Computer Science 2023-07-27 Antares Chen , Lorenzo Orecchia , Erasmo Tani

In this paper, we propose and study a new semi-random model for graph partitioning problems. We believe that it captures many properties of real--world instances. The model is more flexible than the semi-random model of Feige and Kilian and…

Data Structures and Algorithms · Computer Science 2015-03-20 Konstantin Makarychev , Yury Makarychev , Aravindan Vijayaraghavan

A multivariate fractional Poisson process was recently defined in Beghin and Macci (2016) by considering a common independent random time change for a finite dimensional vector of independent (non-fractional) Poisson processes; moreover it…

Probability · Mathematics 2016-09-13 Luisa Beghin , Claudio Macci

This paper is about how to partition decision variables while decomposing a large-scale optimization problem for the best performance of distributed solution methods. Solving a large-scale optimization problem sequen- tially can be…

Optimization and Control · Mathematics 2017-10-26 Yuchen Zheng , Ilbin Lee , Nicoleta Serban

We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…

Computational Complexity · Computer Science 2009-11-29 Ido Ben-Eliezer , Shachar Lovett , Ariel Yadin
‹ Prev 1 8 9 10 Next ›