English
Related papers

Related papers: Poisson trace orders

200 papers

We prove perturbation results for traces on normed ideals in semifinite von Neumann algebra factors. This includes the case of Dixmier traces. In particular, we establish existence of spectral shift measures with initial operators being…

Functional Analysis · Mathematics 2015-06-12 Ken Dykema , Anna Skripka

Properties of relative traces and symmetrizing forms on chains of cyclotomic and affine Hecke algebras are studied. The study relies on a use of bases of these algebras which generalize a normal form for elements of the complex reflection…

Quantum Algebra · Mathematics 2015-06-18 O. V. Ogievetsky , L. Poulain d'Andecy

Border bases can be considered to be the natural extension of Gr\"obner bases that have several advantages. Unfortunately, to date the classical border basis algorithm relies on (degree-compatible) term orderings and implicitly on reduced…

Commutative Algebra · Mathematics 2010-02-05 Gábor Braun , Sebastian Pokutta

In the paper, we describe all total orders $\succ$ compatible with addition on additive subsemigroup $S$ of finite dimensional spaces over rational numbers. We provide a necessary and sufficient condition under which a finitely generated…

Algebraic Geometry · Mathematics 2022-10-25 Askold Khovanskii

Poisson brackets on the polynomial algebra C[x,y,z] are studied. A description of all such brackets is given and, for a significant class of Poisson brackets, the Poisson prime ideals and Poisson primitive ideals are determined. The results…

Rings and Algebras · Mathematics 2012-12-21 David A. Jordan , Sei-Qwon Oh

The Poisson structure arising in the Hamiltonian approach to the rational Gaudin model looks very similar to the so-called modified Reflection Equation Algebra. Motivated by this analogy, we realize a braiding of the mentioned Poisson…

Quantum Algebra · Mathematics 2016-11-25 Dimitri Gurevich , Vladimir Rubtsov , Pavel Saponov , Zoran Skoda

The symmetric algebra $S(\mathfrak g)$ of a reductive Lie algebra $\mathfrak g$ is equipped with the standard Poisson structure, i.e., the Lie-Poisson bracket. Poisson-commutative subalgebras of $S(\mathfrak g)$ attract a great deal of…

Representation Theory · Mathematics 2018-09-05 Dmitri Panyushev , Oksana Yakimova

The aim of this paper is to show that various known characterizations of traces on classical pseudodifferentials operators (PsiDOs) can actually be obtained by very elementary considerations on PsiDOs, using only basic properties of these…

Analysis of PDEs · Mathematics 2010-09-17 Raphael Ponge

The peak algebra is a unital subalgebra of the symmetric group algebra, linearly spanned by sums of permutations with a common set of peaks. By exploiting the combinatorics of sparse subsets of [n-1] (and of certain classes of compositions…

Combinatorics · Mathematics 2016-09-07 Marcelo Aguiar , Kathryn Nyman , Rosa Orellana

We introduce a geometric framework for constructing superintegrable systems from Poisson centralizers (commutants) in the Lie-Poisson algebra $S(\mathfrak{g})$ of a complex semisimple Lie algebra. Starting from a chain of reductive…

Mathematical Physics · Physics 2026-05-15 Kai Jiang , Guorui Ma , Ian Marquette , Junze Zhang , Yao-Zhong Zhang

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

Representation Theory · Mathematics 2025-04-15 Fabio Scarabotti

Following the derivation of the trace formulae in the first paper in this series, we establish here a connection between the spectral statistics of random regular graphs and the predictions of Random Matrix Theory (RMT). This follows from…

Mathematical Physics · Physics 2010-04-28 Idan Oren , Uzy Smilansky

An algebra isomorphism between algebras of matrices and difference operators is used to investigate the discrete integrable hierarchy. We find local and non-local families of R-matrix solutions to the modified Yang-Baxter equation. The…

Exactly Solvable and Integrable Systems · Physics 2009-11-10 H. Aratyn , K. Bering

Measuring how quickly iterative methods converge is essential in computational mathematics, but current approaches have significant limitations. Q-order analysis requires strict smoothness conditions, while R-order analysis lacks precision…

Numerical Analysis · Mathematics 2025-04-09 Xiangmin Jiao , Hongji Gao

We consider the well-studied pattern counting problem: given a permutation $\pi \in \mathbb{S}_n$ and an integer $k > 1$, count the number of order-isomorphic occurrences of every pattern $\tau \in \mathbb{S}_k$ in $\pi$. Our first result…

Data Structures and Algorithms · Computer Science 2024-07-09 Gal Beniamini , Nir Lavee

The Poisson distribution is the default choice of likelihood for probabilistic models of count data. However, due to the equidispersion contraint of the Poisson, such models may have predictive uncertainty that is artificially inflated.…

Methodology · Statistics 2025-07-15 Jimmy Lederman , Aaron Schein

Motivated by the universal obstruction to the deformation quantization of Poisson structures in infinite dimensions we introduce the notion of quantizable odd Lie bialgebra. The main result of the paper is a construction of a highly…

Quantum Algebra · Mathematics 2016-08-24 Anton Khoroshkin , Sergei Merkulov , Thomas Willwacher

We formulate a general prescription for spurion analysis in particle-physics models whose selection rules are described by commutative non-invertible fusion algebras. The construction applies to fusion algebras containing non-invertible…

High Energy Physics - Phenomenology · Physics 2026-04-13 Ling-Xiao Xu

Motivated by a search for Lie group structures on groups of Poisson diffeomorphisms [24], we investigate linearizability of Poisson structures of Poisson groupoids around the unit section. After extending the Lagrangian neighbourhood…

Differential Geometry · Mathematics 2022-12-09 Wilmer Smilde

We present in this paper a general algorithm for solving first-order formulas in particular theories called "decomposable theories". First of all, using special quantifiers, we give a formal characterization of decomposable theories and…

Logic in Computer Science · Computer Science 2007-05-23 Khalil Djelloul