English
Related papers

Related papers: Non-Decomposable Nambu Brackets

200 papers

A ternary Nambu-Poisson algebra (which we call a Nambu-Poisson algebra in the paper) is the underlying algebraic structure of Nambu-Poisson manifolds of order $3$ that appeared in the generalized Hamiltonian mechanics. First, we consider…

Rings and Algebras · Mathematics 2025-10-20 Apurba Das , Fattoum Harrathi , Sami Mabrouk

We consider the concept of "the permutationally invariant (PI) part of a density matrix," which has proven very useful for both efficient quantum state estimation and entanglement characterization of $N$-qubit systems. We show here that the…

Quantum Physics · Physics 2014-05-20 Ting Gao , Fengli Yan , S. J. van Enk

In his pioneering paper [Phys. Rev. E 7, 2405 (1973)], Nambu proposed the idea of multiple Hamiltonian systems. The explicit example examined there is equivalent to the so(3) Lie-Poisson system, which represents noncanonical Hamiltonian…

Mathematical Physics · Physics 2022-06-28 Zensho Yoshida

In the setting of constructive mathematics, we suggest and study a framework for decidability of properties, which allows for finer distinctions than just "decidable, semidecidable, or undecidable". We work in homotopy type theory and use…

Logic in Computer Science · Computer Science 2026-05-14 Tom de Jong , Nicolai Kraus , Aref Mohammadzadeh , Fredrik Nordvall Forsberg

A new family of solutions of the Jacobi partial differential equations for finite-dimensional Poisson systems is investigated. This family is mathematically remarkable, as the functional dependences of the solutions appear to be associated…

Mathematical Physics · Physics 2019-10-22 Benito Hernández-Bermejo

Assumption-based Argumentation (ABA) is a well-known structured argumentation formalism, whereby arguments and attacks between them are drawn from rules, defeasible assumptions and their contraries. A common restriction imposed on ABA…

Artificial Intelligence · Computer Science 2024-01-09 Markus Ulbricht , Nico Potyka , Anna Rapberger , Francesca Toni

Independence of premise principles play an important role in characterizing the modified realizability and the Dialectica interpretations. In this paper we show that a great many intuitionistic set theories are closed under the…

Logic · Mathematics 2019-11-20 Takako Nemoto , Michael Rathjen

Decomposable Negation Normal Forms (DNNFs) are Boolean circuits in negation normal form where the subcircuits leading into each AND gate are defined on disjoint sets of variables. We prove a strongly exponential lower bound on the size of…

Computational Complexity · Computer Science 2015-02-20 Simone Bova , Florent Capelli , Stefan Mengel , Friedrich Slivovsky

This work begins the process of using the decomposition of the diagonal as a tool for studying the rationality of invariant fields of finite groups $G$. Our ground field must be characteristic 0 because of the use we make of Bertini…

Algebraic Geometry · Mathematics 2025-08-28 David J Saltman

This paper studies the problem of decomposing a low-rank positive-semidefinite matrix into symmetric factors with binary entries, either $\{\pm 1\}$ or $\{0,1\}$. This research answers fundamental questions about the existence and…

Data Structures and Algorithms · Computer Science 2019-08-01 Richard Kueng , Joel A. Tropp

Consider an ideal $I \subset R = \bC[x_1,...,x_n]$ defining a complex affine variety $X \subset \bC^n$. We describe the components associated to $I$ by means of {\em numerical primary decomposition} (NPD). The method is based on the…

Algebraic Geometry · Mathematics 2008-05-30 Anton Leykin

We prove an algebraic ``no-go theorem'' to the effect that a nontrivial Poisson algebra cannot be realized as an associative algebra with the commutator bracket. Using this, we show that there is an obstruction to quantizing the Poisson…

Mathematical Physics · Physics 2007-05-23 Mark J. Gotay , Janusz Grabowski

Recall that a Hausdorff space $X$ is said to be Namioka if for every compact (Hausdorff) space $Y$ and every metric space $Z$, every separately continuous function $f:X\times{Y}\rightarrow{Z}$ is continuous on $D\times{Y}$ for some dense…

General Topology · Mathematics 2012-07-17 Zbigniew Piotrowski , Russell Waller

The main purpose of this paper is to study non-commutative ternary Nambu-Poisson algebras and their Hom-type version. We provide construction results dealing with tensor product and direct sums of two (non-commutative) ternary…

Rings and Algebras · Mathematics 2014-10-09 Hanene Amri , Abdenacer Makhlouf

Automorphism, isomorphism, and embedding problems are investigated for a family of Nambu-Poisson algebras (or $n$-Lie Poisson algebras) using Poisson valuations.

Rings and Algebras · Mathematics 2023-12-06 Hongdi Huang , Xin Tang , Xingting Wang , James J. Zhang

We study the decomposition of zero-dimensional persistence modules, viewed as functors valued in the category of vector spaces factorizing through sets. Instead of working directly at the level of vector spaces, we take a step back and…

Algebraic Topology · Mathematics 2023-03-13 Ángel Javier Alonso , Michael Kerber

For varifolds whose first variation is representable by integration, we introduce the notion of indecomposability with respect to locally Lipschitzian real valued functions. Unlike indecomposability, this weaker connectedness property is…

Differential Geometry · Mathematics 2025-12-24 Ulrich Menne , Christian Scharrer

Nambu's construction of multi-linear brackets for super-integrable systems can be thought of as degenerate Poisson brackets with a maximal set of Casimirs in their kernel. By introducing privileged coordinates in phase space these…

Quantum Physics · Physics 2008-11-26 Y. Nutku

We introduce an interesting method of proving separable reduction theorems - the method of elementary submodels. We are studying whether it is true that a set (function) has given property if and only if it has this property with respect to…

Functional Analysis · Mathematics 2013-01-08 Marek Cúth

We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$, together with the (non-contiguous) subword ordering. In terms of decidability of quantifier alternation fragments, this logic is…

Logic in Computer Science · Computer Science 2024-02-14 Pascal Baumann , Moses Ganardi , Ramanathan S. Thinniyam , Georg Zetzsche