相关论文: Remarks on Nambu-Poisson and Nambu-Jacobi brackets

Reynolds' parametricity originally equips types with proof-irrelevant binary propositional relations over the types. But such relations can also be taken proof-relevant or unary, and described either in an indexed or fibred way.…

New generalized Poisson structures are introduced by using skew-symmetric contravariant tensors of even order. The corresponding `Jacobi identities' are given by the vanishing of the Schouten-Nijenhuis bracket. As an example, we provide the…

We define inductively unstable n-fold Toda brackets for every n>2 in the category of spaces with base points, and then define stable ones.

For the isospectral Darboux transformations of the discrete quantum mechanics with real shifts, there are two methods: type I and type II constructions. Based on the type I construction, the type I multi-indexed little $q$-Jacobi and little…

We define mosaics, which are naturally in bijection with Knutson-Tao puzzles. We define an operation on mosaics, which shows they are also in bijection with Littlewood-Richardson skew-tableaux. Another consequence of this construction is…

Around 20 years ago, M. Van den Bergh introduced double Poisson brackets as operations on associative algebras inducing Poisson brackets under the representation functor. Weaker versions of these operations, called modified double Poisson…

We show that the space of observables of test particles carries a natural Jacobi structure which is manifestly invariant under the action of the Poincar\'{e} group. Poisson algebras may be obtained by imposing further requirements. A…

Let X and Y be two smooth projective n-dimensional algebraic varieties X and Y over C with trivial canonical line bundles. We use methods of p-adic analysis on algebraic varieties over local number fields to prove that if X and Y are…

This paper studies the relationship between labelled and nested calculi for propositional intuitionistic logic, first-order intuitionistic logic with non-constant domains and first-order intuitionistic logic with constant domains. It is…

The dynamics of topological open branes is controlled by Nambu Brackets. Thus, they might be quantized through the consistent quantization of the underlying Nambu brackets, including odd ones: these are reachable systematically from even…

Hamiltonian formulation of N=3 systems is considered in general. The Jacobi equation is solved in three classes. Compatible Poisson structures in these classes are determined and explicitly given. The corresponding bi-Hamiltonian systems…

In this paper we investigate the algebraic structure of the truth tables of all bracketed formulae with n distinct variables connected by the binary connective of implication.

The ordinary Poisson brackets in field theory do not fulfil the Jacobi identity if boundary values are not reasonably fixed by special boundary conditions. We show that these brackets can be modified by adding some surface terms to lift…

We introduce a family of compatible Poisson brackets on the space of $2\times 2$ polynomial matrices, which contains the reflection equation algebra bracket. Then we use it to derive a multi-Hamiltonian structure for a set of integrable…

We define an equivalence relation on propositions and a proof system where equivalent propositions have the same proofs. The system obtained this way resembles several known non-deterministic and algebraic lambda-calculi.

We propose a generalization of Artin's definition of algebraic stack, which we call {\em geometric $n$-stack}. The main observation is that there is an inductive structure to the definition whereby the ingredients for the definition of…

We continue investigating the structure of externally definable sets in NIP theories and preservation of NIP after expanding by new predicates. Most importantly: types over finite sets are uniformly definable; over a model, a family of…

A nonzero pattern is a matrix with entries in {0,*}. A pattern is potentially nilpotent if there is some nilpotent real matrix with nonzero entries in precisely the entries indicated by the pattern. We develop ways to construct some…

Two structures $M, N$ in the same language are called probably isomorphic if they (or, in case of metric structures, their completions) are isomorphic after forcing with the Lebesgue measure algebra. We show that, if $M$ and $N$ are…

A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n + 1 into parts greater than one. Some commentary about the history of partitions and compositions is…