English
Related papers

Related papers: A low-energy decomposition theorem

200 papers

A theorem of Andrews equates partitions in which no part is repeated more than 2k-1 times to partitions in which, if j appears at least k times, all parts less than j also do so. This paper proves the theorem bijectively, with some of the…

Combinatorics · Mathematics 2010-10-14 William J. Keith

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

Algebraic Geometry · Mathematics 2009-10-12 Arnaud Bodin

Zeckendorf proved that every positive integer has a unique partition as a sum of non-consecutive Fibonacci numbers. Similarly, every natural number can be partitioned into a sum of non-consecutive terms of the Lucas sequence, although such…

Number Theory · Mathematics 2021-08-31 Hung V. Chu , David C. Luo , Steven J. Miller

We introduce with geometric means a density matrix decomposition of a multipartite quantum system of a finite dimension into two density matrices: a separable one, also known as the best separable approximation, and an essentially entangled…

Quantum Physics · Physics 2015-10-28 V. M. Akulin , G. A. Kabatyanski , A. Mandilara

The aim of this work is to show how we can decompose a module (if decomposable) into an indecomposable module with the help of the minimization process.

Symbolic Computation · Computer Science 2016-08-31 Gerard Duchamp , Hatem Hadj Kacem , Eric Laugerotte

In this note, we obtain a formula which leads to a practical and efficient method to calculate the number of partitions of n into parts not divisible by m for given natural numbers n and m.

Combinatorics · Mathematics 2022-05-13 Damanvir Singh Binner

We present an understandable, efficient, and streamlined proof of the Holonomy Decomposition for finite transformation semigroups and automata. This constructive proof closely follows the existing computational implementation. Its novelty…

Group Theory · Mathematics 2015-08-27 Attila Egri-Nagy , Chrystopher L. Nehaniv

We prove that any multi-variate Hasse-Schmidt derivation can be decomposed in terms of substitution maps and uni-variate Hasse-Schmidt derivations. As a consequence we prove that the bracket of two $m$-integrable derivations is also…

Algebraic Geometry · Mathematics 2021-07-20 Luis Narváez-Macarro , María de la Paz Tirado Hernández

In this paper, we give out some effective criterions which can be used to judge the separability of multipartite pure states. We obtain the relationship between separability and Schmidt decomposable of multipartite pure states in Theorem1.…

Quantum Physics · Physics 2007-05-23 Zongwen Yu , Su Hu

Generalizing a well known theorem for finite matroids, we prove that for every (infinite) connected matroid M there is a unique tree T such that the nodes of T correspond to minors of M that are either 3-connected or circuits or cocircuits,…

Combinatorics · Mathematics 2015-06-08 Elad Aigner-Horev , Reinhard Diestel , Luke Postle

Suppose that G is a finite group and A is a subset of G such that 1_A has algebra norm at most M. Then 1_A is a plus/minus sum of at most L cosets of subgroups of G, and L can be taken to be triply tower in O(M). This is a quantitative…

Classical Analysis and ODEs · Mathematics 2012-12-04 Tom Sanders

In this paper we prove that every irreducible representation of a Leibniz algebra can be obtained from irreducible representations of the semisimple Lie algebra from the Levi decomposition. We also prove that - in general - for (semi)simple…

Representation Theory · Mathematics 2015-02-26 Fialowski Alice , Mihálka Éva Zsuzsanna

We show that we can interpret concatenation theories in arithmetical theories without coding sequences.

Logic · Mathematics 2021-12-30 Juvenal Murwanashyaka

We prove two theorems on the locally finite decompositions of the cones of divisors by the cones which correspond to canonical and minimal models. We introduce the concept of the numerical linear systems in order to simplify the argument on…

Algebraic Geometry · Mathematics 2009-09-22 Yujiro Kawamata

We show that every finite ring has a partition, where each block corresponds to one idempotent. Remarkably, this partition provides a way to \emph{lift} a wide variety of special elements such as idempotents, nilpotents, unipotents, roots…

Rings and Algebras · Mathematics 2023-04-19 Vineeth Chintala

We define two recursive functions obtained by decomposition of a given interval into four close parts and prove two lemmas which determine features of these functions.

Discrete Mathematics · Computer Science 2013-06-11 Mark Korenblit , Vadim E. Levit

In Combinatorial Game Theory, short game forms are defined recursively over all the positions the two players are allowed to move to. A form is decomposable if it can be expressed as a disjunctive sum of two forms with smaller birthday. If…

Combinatorics · Mathematics 2023-06-13 Michael Fisher , Neil A. McKay , Rebecca Milley , Richard J. Nowakowski , Carlos P. Santos

We establish a version of a semistable reduction theorem over a log point with a non-trivial nilpotent structure. In order to do this we extend the classical desingularization theories to non-reduced schemes with generically principal…

Algebraic Geometry · Mathematics 2024-02-16 Alexander E. Motzkin , Michael Temkin

We present a new topological proof of the infinitude of prime numbers with a new topology. Furthermore, in this topology, we characterize the infinitude of any non-empty subset of prime numbers.

Number Theory · Mathematics 2024-10-30 Jhixon Macías

We prove, in particular, that for any finite set of real numbers A with |A/A| \ll |A| one has |A-A| > |A|^{5/3 - o(1)}. Also we show that |3A| > |A|^{2-o(1)} in the case.

Combinatorics · Mathematics 2018-03-14 Ilya D. Shkredov
‹ Prev 1 3 4 5 6 7 10 Next ›