English
Related papers

Related papers: Legendre $G$-array pairs and the theoretical unifi…

200 papers

Let G denote either a special orthogonal group or a symplectic group defined over the complex numbers. We prove the following saturation result for G: given dominant weights \lambda^1, ..., \lambda^r such that the tensor product…

Representation Theory · Mathematics 2011-11-24 Steven V Sam

Let G be a compact connected Lie group and p : E \to {\Sigma}^2V a principal G-bundle with a characteristic map \alpha : A={\Sigma}V \to G. By combining cone decomposition arguments in Iwase-Mimura-Nishimoto [3,5] with computations of…

Algebraic Topology · Mathematics 2007-05-23 Norio Iwase , Akira Kono

We prove that there are at least as many exact embedded Lagrangian fillings as seeds for Legendrian links of finite type $\mathsf{ADE}$ or affine type $\tilde{\mathsf{D}} \tilde{\mathsf{E}}$. We also provide as many Lagrangian fillings with…

Symplectic Geometry · Mathematics 2024-08-20 Byung Hee An , Youngjin Bae , Eunjeong Lee

We determine the distribution of the sandpile group (also known as the Jacobian) of the Erd\H{o}s-R\'{e}nyi random graph $G(n,q)$ along with its canonical duality pairing as $n$ tends to infinity, fully resolving a conjecture from 2015 due…

Combinatorics · Mathematics 2023-11-14 Eliot Hodges

Let $\Lambda$ be a finite-dimensional associative algebra over a field. A semibrick pair is a finite set of $\Lambda$-modules for which certain Hom- and Ext-sets vanish. A semibrick pair is completable if it can be enlarged so that a…

Representation Theory · Mathematics 2023-05-25 Emily Barnard , Eric J. Hanson

We study the relationship between two measures of pseudorandomness for families of binary sequences: family complexity and cross-correlation measure introduced by Ahlswede et al.\ in 2003 and recently by Gyarmati et al., respectively. More…

Number Theory · Mathematics 2014-08-22 Arne Winterhof , Oğuz Yayla

Let $G$ be a finite group of Lie type. In studying the cross-characteristic representation theory of $G$, the (specialized) Hecke algebra $H=\End_G(\ind_B^G1_B)$ has played a important role. In particular, when $G=GL_n(\mathbb F_q)$ is a…

Representation Theory · Mathematics 2023-01-19 Jie Du , Brian Parshall , Leonard Scott

We give a one-to-one correspondence between ideals in the Steinberg algebra of a Hausdorff ample groupoid $G$, and certain families of ideals in the group algebras of isotropy groups in $G$. This generalises a known ideal correspondence…

Rings and Algebras · Mathematics 2021-09-20 Simon W. Rigby , Thibaud van den Hove

We study the perfect matching lattice of a matching covered graph $G$, generated by the incidence vectors of its perfect matchings. Building on results of Lov\'asz and de Carvalho, Lucchesi, and Murty, we give a polynomial-time algorithm…

Combinatorics · Mathematics 2025-11-07 Olha Silina

Let $F$ be a locally compact non-Archimedean field of characteristic $0$, and let $G$ be either the split special orthogonal group $\mathrm{SO}_{2n+1}(F)$ or the symplectic group $\mathrm{Sp}_{2n}(F)$. The goal of this paper is to give an…

Representation Theory · Mathematics 2026-05-27 Thomas Lanard , Alberto Mínguez

An extensive table of pairs of functions linked by the Legendre transformation is presented. Many special functions and formulas that are used in the sciences are included in the pairs. Formulations are provided for finding the Legendre…

Classical Analysis and ODEs · Mathematics 2022-08-11 Quinn T. Kolt , Steven J. Kilner , David L. Farnsworth

We initiate the study of the Diverse Pair of (Maximum/ Perfect) Matchings problems which given a graph $G$ and an integer $k$, ask whether $G$ has two (maximum/perfect) matchings whose symmetric difference is at least $k$. Diverse Pair of…

Data Structures and Algorithms · Computer Science 2020-09-11 Fedor V. Fomin , Petr A. Golovach , Lars Jaffke , Geevarghese Philip , Danil Sagunov

We discuss as a fundamental characteristic of orthogonal polynomials like the existence of a Lie algebra behind them, can be added to their other relevant aspects. At the basis of the complete framework for orthogonal polynomials we put…

Mathematical Physics · Physics 2015-06-05 E Celeghini , Mariano A del Olmo

K.T. Chen showed that iterated integrals give comparison isomorphisms between the cohomologies of bar complexes and fundamental group rings. This led to the development of an algebraic-geometric approach to studying periods given by…

Number Theory · Mathematics 2025-07-21 Eisuke Otsuka

We show that the ratio of the number of near perfect matchings to the number of perfect matchings in $d$-regular strong expander (non-bipartite) graphs, with $2n$ vertices, is a polynomial in $n$, thus the Jerrum and Sinclair Markov chain…

Data Structures and Algorithms · Computer Science 2021-03-17 Farzam Ebrahimnejad , Ansh Nagda , Shayan Oveis Gharan

In this paper, we obtain a full classification of reductive dual pairs in a, real or complex, Lie superalgebra $\mathfrak{spo}(E)$ and Lie supergroup $\textbf{SpO}(E)$. Moreover, by looking at the natural action of the orthosymplectic Lie…

Representation Theory · Mathematics 2026-02-25 Allan Merino , Hadi Salmasian

In Roger Howe's 1989 paper, ``Remarks on classical invariant theory," Howe introduces the notion of a dual pair of Lie subalgebras: a pair $(\mathfrak{g}_1, \mathfrak{g}_2)$ of reductive Lie subalgebras of a Lie algebra $\mathfrak{g}$ such…

Representation Theory · Mathematics 2024-01-23 Marisa Gaetz

Let $G$ be a finite group. A number of graphs with the vertex set $G$ have been studied, including the power graph, enhanced power graph, and commuting graph. These graphs form a hierarchy under the inclusion of edge sets, and it is useful…

Combinatorics · Mathematics 2021-12-07 G. Arunkumar , Peter J. Cameron , Rajat Kanti Nath , Lavanya Selvaganesh

By assuming a type of balance for length $\ell=87$ and non-trivial subgroups of multiplier groups of Legendre pairs (LPs) for length $\ell=85$, we find LPs of these lengths. We then study the power spectral density (PSD) values of…

Let $\mathrm{pm}(G)$ denote the number of perfect matchings of a graph $G$, and let $K_{r\times 2n/r}$ denote the complete $r$-partite graph where each part has size $2n/r$. Johnson, Kayll, and Palmer conjectured that for any perfect…

Combinatorics · Mathematics 2022-11-04 Sam Spiro , Erlang Surya