English
Related papers

Related papers: Enhanced Bruhat decomposition and Morse theory

200 papers

Over the past years, Polar codes have arisen as a highly effective class of linear codes, equipped with a decoding algorithm of low computational complexity. This family of codes share a common algebraic formalism with the well-known…

Combinatorics · Mathematics 2024-06-17 Jicheng Ma , Guiying Yan

In this paper the three-dimensional vertex model is given, which is the duality of the three-dimensional Baxter-Bazhanov (BB) model. The braid group corresponding to Frenkel-Moore equation is constructed and the transformations $R, I$ are…

High Energy Physics - Theory · Physics 2009-09-25 Zhan-Ning Hu

Canonical BRST quantization of the topological particle defined by a Morse function h is described. Stochastic calculus, using Brownian paths which implement the WKB method in a new way providing rigorous tunnelling results even in curved…

High Energy Physics - Theory · Physics 2009-10-31 Alice Rogers

From the work of Bauer and Lesnick, it is known that there is no functor from the category of pointwise finite-dimensional persistence modules to the category of barcodes and overlap matchings. In this work, we introduce sub-barcodes and…

Computational Geometry · Computer Science 2025-04-15 Oliver A. Chubet , Kirk P. Gardner , Donald R. Sheehy

We extend to several combinatorial Hopf algebras the endomorphism of symmetric functions sending the first power-sum to zero and leaving the other ones invariant. As a transformation of alphabets, this is the (1-E)-transform, where E is the…

Combinatorics · Mathematics 2013-02-12 F. Hivert , J. -G. Luque , J. -C. Novelli , J. -Y. Thibon

On spaces of finite signed Borel measures on a metric space one has introduced the Fortet-Mourier and Dudley norms, by embedding the measures into the dual space of the Banach space of bounded Lipschitz functions, equipped with different --…

Functional Analysis · Mathematics 2023-05-16 Sander C. Hille , Esmee S. Theewis

In this paper, we use reinforcement learning to find effective decoding strategies for binary linear codes. We start by reviewing several iterative decoding algorithms that involve a decision-making process at each step, including…

Information Theory · Computer Science 2019-12-10 Fabrizio Carpi , Christian Häger , Marco Martalò , Riccardo Raheli , Henry D. Pfister

We consider a smooth one-parameter family $t \to f_t$ of diffeomorphisms with compact transitive Axiom A attractors. Our first result (corrected) is that for any function $G$ in the Sobolev space $H^r_p$, with $p>1$ and $0<r<1/p$, the map…

Dynamical Systems · Mathematics 2017-06-22 Viviane Baladi , Tobias Kuna , Valerio Lucarini

The set of all uniquely decipherable (UD) codes is partially ordered by refinement, meaning that all strings in the cruder code can be represented as concatenations of strings taken from the finer code. The Kraft sum is a monotone…

Combinatorics · Mathematics 2019-07-23 Stephan Foldes

These notes are not intended to substitute for a course in linear algebra on reduction of endomorphisms nor an exhaustive presentation of the Dunford's decomposition. We will limit ourselves to the case where the base is R or C, and the…

Commutative Algebra · Mathematics 2013-07-18 Alaeddine Ben Rhouma

We give a full description of the structure under inclusion of all finite level Borel classes of functions, and provide an elementary proof of the well-known fact that not every Borel function can be written as a countable union of…

Logic · Mathematics 2013-05-14 Luca Motto Ros

In this paper, we study Lipschitz-Fredholm vector fields on Bounded-Fr\'{e}chet-Finsler manifolds. In this context we generalize the Morse-Sard-Brown theorem, asserting that if $M$ is a connected smooth bounded-Fr\'{e}chet-Finsler manifold…

Differential Geometry · Mathematics 2023-08-01 Kaveh Eftekharinasab

The basic disentanglement theorem established by the present authors states that estimates on a weighted geometric mean over (convex) families of functions can be disentangled into quantitatively linked estimates on each family separately.…

Functional Analysis · Mathematics 2023-07-06 Anthony Carbery , Timo S. Hänninen , Stefán Ingi Valdimarsson

We prove differentiability of certain linear combinations of the Lyapunov spectra of a flow on a principal bundle of a semi-simple Lie group. The specific linear combinations that yield differentiability are determined by the finest Morse…

Dynamical Systems · Mathematics 2014-05-07 Thiago F. Ferraiol , Luiz A. B. San Martin

Let $k$ be a perfect field. Assume that the characteristic of $k$ satisfies certain tameness assumptions \eqref{tameness}. Let $\mathcal O_{_n} := k\llbracket z_{_1}, \ldots, z_{_n}\rrbracket$ and set $K_{_n} := \text{Fract}~\cO_{_n}$. Let…

Algebraic Geometry · Mathematics 2026-05-27 Vikraman Balaji , Yashonidhi Pandey

The classical Morse--Sard theorem claims that for a mapping $v:\mathbb R^n\to\mathbb R^{m+1}$ of class $C^k$ the measure of critical values $v(Z_{v,m})$ is zero under condition $k\ge n-m$. Here the critical set, or $m$-critical set is…

Analysis of PDEs · Mathematics 2019-06-11 Adele Ferone , Mikhail V. Korobkov , Alba Roviello

We characterize the Borel measures $\mu$ on $\mathbb{R}$ for which the associated dyadic Hilbert transform, or its adjoint, is of weak-type $(1,1)$ and/or strong-type $(p,p)$ with respect to $\mu$. Surprisingly, the class of such measures…

Classical Analysis and ODEs · Mathematics 2018-10-10 Luis Daniel López-Sánchez , José María Martell , Javier Parcet

Generators and relations are given for the subalgebra of cocommutative elements in the quantized coordinate rings of the classical groups, where the deformation parameter q is transcendental. This is a ring theoretic formulation of the well…

Quantum Algebra · Mathematics 2007-05-23 M. Domokos , T. H. Lenagan

Deterministic recursive algorithms for the computation of generalized Bruhat decomposition of the matrix in commutative domain are presented. This method has the same complexity as the algorithm of matrix multiplication.

Symbolic Computation · Computer Science 2017-02-24 Gennadi Malaschonok

If ${A}$ has no eigenvalues on the closed negative real axis, and $B$ is arbitrary square complex, the matrix-matrix exponentiation is defined as $A^B:=e^{\log({A}){B}}$. This function arises, for instance, in Von Newmann's…

Numerical Analysis · Mathematics 2017-03-28 João R. Cardoso , Amir Sadeghi