English
Related papers

Related papers: Equivalence classes of lower and upper descent wea…

200 papers

This work provides an extension of parts of the classical finite dimensional sub-elliptic theory in the context of infinite dimensional compact connected metrizable groups. Given a well understood and well behaved bi-invariant Laplacian,…

Probability · Mathematics 2025-03-03 Qi Hou , Laurent Saloff-Coste

We characterize all semigroups $(T(t))_{t\geq0}$ on $L^2(\Omega)$ sandwiched between Dirichlet and Neumann ones, i.e.: \begin{equation*}\label{eq:san} e^{t\Delta_D}\leq T(t)\leq e^{t\Delta_N}\quad,\text{for all }t\geq0 \end{equation*} in…

Functional Analysis · Mathematics 2020-11-03 Khalid Akhlil

In this paper, we present a relative proof for Goldbach's strong conjecture. To this end, we first present a heuristic model for representing even numbers called Semi-continuous Model for Even Numbers or briefly S.C.E Model, and then by…

Number Theory · Mathematics 2026-05-21 Aref Zadehgol Mohammadi , Mohsen Kolahdouz

Various aspects of orbifolds and cosets of the small $\mathcal{N}=4$ superconformal algebra are studied. First, we determine minimal strong generators for generic and specific levels. As a corollary, we obtain the vertex algebra of global…

Representation Theory · Mathematics 2021-05-21 Thomas Creutzig , Andrew R. Linshaw , Wolfgang Riedler

In the problem of semialgebraic range searching, we are to preprocess a set of points in $\mathbb{R}^D$ such that the subset of points inside a semialgebraic region described by $O(1)$ polynomial inequalities of degree $\Delta$ can be found…

Computational Geometry · Computer Science 2022-03-16 Peyman Afshani , Pingan Cheng

Two strings of the same length are said to Cartesian-tree match (CT-match) if their Cartesian-trees are isomorphic [Park et al., TCS 2020]. Cartesian-tree matching is a natural model that allows for capturing similarities of numerical…

Data Structures and Algorithms · Computer Science 2026-01-01 Taketo Tsujimoto , Yuki Yonemoto , Hiroki Shibata , Takuya Mieno , Yuto Nakashima , Shunsuke Inenaga

Following Lusztig, we consider a Coxeter group $W$ together with a weight function $L$. This gives rise to the pre-order relation $\leq_{L}$ and the corresponding partition of $W$ into left cells. We introduce an equivalence relation on…

Representation Theory · Mathematics 2007-05-23 Meinolf Geck

Superconformal `type B' quantum mechanical sigma models arise in a variety of interesting contexts, such as the description of D-brane bound states in an AdS$_2$ decoupling limit. Focusing on $N=2B$ models, we study superconformal indices…

High Energy Physics - Theory · Physics 2024-10-02 Joris Raeymaekers , Canberk Sanli , Dieter Van den Bleeken

For any Coxeter system $(W,S)$ of rank $n$, we introduce an abstract boolean complex (simplicial poset) of dimension $2n-1$ that contains the Coxeter complex as a relative subcomplex. Faces are indexed by triples $(I,w,J)$, where $I$ and…

Combinatorics · Mathematics 2016-07-04 T. Kyle Petersen

Let $\Delta=\Delta_1\times\ldots\times \Delta_d\subseteq\mathbb{R}^n$, where $\mathbb{R}^n=\mathbb{R}^{n_1}\times\cdots\times\mathbb{R}^{n_d}$ with each $\Delta_i\subseteq\mathbb{R}^{n_i}$ a non-degenerate simplex of $n_i$ points. We prove…

Combinatorics · Mathematics 2023-01-27 Neil Lyall , Akos Magyar

Let $\mathfrak{g}$ be a basic Lie superalgebra and $f$ be an odd nilpotent element in an $\mathfrak{osp}(1|2)$ subalgebra of $\mathfrak{g}$. We provide a mathematical proof of the statement that the W-algebra $W^k(\mathfrak{g},F)$ for…

Mathematical Physics · Physics 2025-10-07 Andrew Linshaw , Arim Song , Uhi Rinn Suh

A poset $P= (X, \prec)$ has an interval representation if each $x \in X$ can be assigned a real interval $I_x$ so that $x \prec y$ in $P$ if and only if $I_x$ lies completely to the left of $I_y$. Such orders are called \emph{interval…

Combinatorics · Mathematics 2018-04-11 Simona Boyadzhiyska , Garth Isaak , Ann Trenk

We study two constructions related to the intervals of finite posets. The first one is a poset. The second one is more complicated. Loosely speaking it can be seen as a poset with some extra zero-relations. As main result, we show that…

Combinatorics · Mathematics 2018-01-17 Frederic Chapoton , Sefi Ladkani , Baptiste Rognerud

We unify several seemingly different graph and digraph classes under one umbrella. These classes are all broadly speaking different generalizations of interval graphs, and include, in addition to interval graphs, also adjusted interval…

Discrete Mathematics · Computer Science 2018-06-28 Pavol Hell , Jing Huang , Ross M. McConnell , Arash Rafiey

We study the partial orders induced on Wachs and signed Wachs permutations by the Bruhat and weak orders of the symmetric and hyperoctahedral groups. We show that these orders are graded, determine their rank function, characterize their…

Combinatorics · Mathematics 2022-12-12 Francesco Brenti , Paolo Sentinelli

We survey the theory of increasing and decreasing subsequences of permutations. Enumeration problems in this area are closely related to the RSK algorithm. The asymptotic behavior of the expected value of the length is(w) of the longest…

Combinatorics · Mathematics 2007-05-23 Richard P. Stanley

We establish a Bruhat decomposition indexed by the wreath product $\Sigma_m\wr \Sigma_d$ between two symmetric groups -- note that $\Sigma_m\wr \Sigma_d$ is not a Coxeter group in general. We show that such a decomposition affords a…

Representation Theory · Mathematics 2026-05-01 You-Hung Hsu , Chun-Ju Lai

The extended weak order on a Coxeter group $W$ is the poset of biclosed sets in its root system. In (Barkley-Speyer 2024), it was shown that when $W=\widetilde{S}_n$ is the affine symmetric group, then the extended weak order is a quotient…

Combinatorics · Mathematics 2025-02-11 Grant T. Barkley

We study the congruence lattice of the poset of regions of a hyperplane arrangement, with particular emphasis on the weak order on a finite Coxeter group. Our starting point is a theorem from a previous paper which gives a geometric…

Combinatorics · Mathematics 2026-05-13 Nathan Reading

An {\it overlap representation} of a graph $G$ assigns sets to vertices so that vertices are adjacent if and only if their assigned sets intersect with neither containing the other. The {\it overlap number} $\ol(G)$ (introduced by Rosgen)…