English
Related papers

Related papers: A State Polytope Decomposition Formula

200 papers

The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.

Number Theory · Mathematics 2010-08-12 Melsik K. Kyuregyan , Gohar M. Kyureghyan

An algorithm for computing power conjugate presentations for finite soluble quotients of predetermined structure of finitely presented groups is described. Practical aspects of an implementation are discussed.

Group Theory · Mathematics 2018-01-30 Alice C. Niemeyer

We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…

Representation Theory · Mathematics 2018-03-06 Vladimir V. Kornyak

The normalization of scattering states is more than a rote step necessary to calculate expectation values. This normalization actually contains important information regarding the density of the scattering spectrum (along with useful…

Quantum Physics · Physics 2025-05-27 Chris L. Lin

We present a family of 3--qubit states to which any arbitrary state can be depolarized. We fully classify those states with respect to their separability and distillability properties. This provides a sufficient condition for…

Quantum Physics · Physics 2009-01-23 W. Dür , J. I. Cirac , R. Tarrach

We generalize the logarithmic decomposition theorem of Deligne-Illusie to a filtered version. There are two applications. The easier one provides a mod $p$ proof for a vanishing theorem in characteristic zero. The deeper one gives rise to a…

Algebraic Geometry · Mathematics 2021-09-07 Zebao Zhang

We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of Minkowski decomposability. Various properties of skeletons of polytopes are exhibited, each sufficient to guarantee indecomposability of a…

Combinatorics · Mathematics 2016-07-05 Krzysztof Przesławski , David Yost

A method is presented that reduces the number of terms of systems of linear equations (algebraic, ordinary and partial differential equations). As a byproduct these systems have a tendency to become partially decoupled and are more likely…

Symbolic Computation · Computer Science 2007-05-23 Thomas Wolf

A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…

Metric Geometry · Mathematics 2014-03-12 István Kovács , Géza Tóth

We provide a necessary and sufficient condition for separability of Gaussian states of bipartite systems of arbitrarily many modes. The condition provides an operational criterion since it can be checked by simple computation. Moreover, it…

Quantum Physics · Physics 2009-11-07 G. Giedke , B. Kraus , M. Lewenstein , J. I. Cirac

In this article we will derive a combinatorial formula for the partition function p(n). In the second part of the paper we will establish connection between partitions and q-binomial coefficients and give new interpretation for q-binomial…

Combinatorics · Mathematics 2016-05-10 Zhumagali Shomanov

A versatile new approach for calculating the depletion potential in a hard sphere mixture is presented. This is valid for any number of components and for arbitrary densities. We describe two different routes to the depletion potential for…

Soft Condensed Matter · Physics 2009-10-31 B. Götzelmann , R. Roth , S. Dietrich , M. Dijkstra , R. Evans

Let $A$ be a finite-dimensional algebra over an algebraically closed field $\Bbbk$. For any finite-dimensional $A$-module $M$ we give a general formula that computes the indecomposable decomposition of $M$ without decomposing it, for which…

Representation Theory · Mathematics 2017-03-24 Hideto Asashiba , Ken Nakashima , Michio Yoshiwaki

We present a polynomial time algorithm to compute any fixed number of the highest coefficients of the Ehrhart quasi-polynomial of a rational simplex. Previously such algorithms were known for integer simplices and for rational polytopes of…

Combinatorics · Mathematics 2007-05-23 Alexander Barvinok

By means of a partial wave decomposition, we separate their contributions to the equation of state of symmetric nuclear matter for the N3LO pseudo-potential. In particular, we show that although both the tensor and the spin-orbit terms do…

Nuclear Theory · Physics 2014-12-08 D. Davesne , J. Meyer , A. Pastore , J. Navarro

For given depth of a we derive a formula for the depth of the image of that term under a given hypersubstitution.

Rings and Algebras · Mathematics 2008-12-01 Klaus Denecke , Jorg Koppitz , Slavcho Shtrakov

We give a formula for the coefficients of the Yablonskii-Vorob'ev polynomial. Also the reduction modulo a prime number of the polynomial is studied.

Quantum Algebra · Mathematics 2007-05-23 Masanobu Kaneko , Hiroyuki Ochiai

We classify here combinatorially rigid simple polytopes with three facets more than their dimension.

Combinatorics · Mathematics 2015-12-01 Frédéric Bosio

Developing robust representations of chemical structures that enable models to learn topological inductive biases is challenging. In this manuscript, we present a representation of atomistic systems. We begin by proving that our…

Machine Learning · Computer Science 2024-09-27 Rahul Khorana , Marcus Noack , Jin Qian

We give an invariant formula for a star product with separation of variables on a pseudo-Kahler manifold.

Quantum Algebra · Mathematics 2015-05-30 Alexander Karabegov
‹ Prev 1 8 9 10 Next ›