English
Related papers

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

200 papers

We discuss some aspects and examples of applications of dual algebraic pairs $({\cal G}_1,{\cal G}_2)$ in quantum many-body physics. They arise in models whose Hamiltonians $H$ have invariance groups $G_i$. Then one can take ${\cal G}_1 =…

Quantum Physics · Physics 2007-05-23 V. P. Karassiov

A generalised Legendrian rack is a rack equipped with a Legendrian structure, which is a pair of maps encoding the information of Legendrian Reidemeister moves together with up and down cusps in the front diagram of an oriented Legendrian…

Geometric Topology · Mathematics 2025-10-15 Biswadeep Karmakar , Deepanshi Saraf , Mahender Singh

Zonotopal algebras (external, central, and internal) of an undirected graph G introduced by Postnikov-Shapiro and Holtz-Ron, are finite-dimensional commutative graded algebras whose Hilbert series contain a wealth of combinatorial…

Commutative Algebra · Mathematics 2026-01-27 Anatol Kirillov , Gleb Nenashev , Boris Shapiro , Arkady Vaintrob

In this paper we introduce a simple method of searching for the prime pairs in the famous Goldbach Conjecture. The method, which is based on certain integer identities as well as an observation related to the remainder property, enables us…

General Mathematics · Mathematics 2015-05-07 Wei Sheng Zeng , Ziqi Sun

We prove the BMM symmetrising trace conjecture for the exceptional complex reflection groups $G_4,\,G_5,\,G_6,\,G_7,\,G_8$ using a combination of algorithms programmed in different languages (C++, SAGE, GAP3, Mathematica). Our proof depends…

Representation Theory · Mathematics 2019-04-04 Christina Boura , Eirini Chavli , Maria Chlouveraki , Konstantinos Karvounis

A perfect pseudo-matching M in a cubic graph G is a spanning subgraph of G such that every component of M is isomorphic to K_2 or to K_1,3. In view of snarks G with dominating cycle C, this is a natural generalization of perfect matchings…

Combinatorics · Mathematics 2019-05-14 Herbert Fleischner , Behrooz Bagheri Gh. , Benedikt Klocker

Helmke et al. have recently given a formula for the number of reachable pairs of matrices over a finite field. We give a new and elementary proof of the same formula by solving the equivalent problem of determining the number of so called…

Combinatorics · Mathematics 2016-03-18 Samrith Ram

The Lloyd Theorem of (Sol\'e, 1989) is combined with the Schwartz-Zippel Lemma of theoretical computer science to derive non-existence results for perfect codes in the Lee metric, NRT metric, mixed Hamming metric, and for the sum-rank…

Combinatorics · Mathematics 2026-01-21 Minjia Shi , Jing Wang , Patrick Solé

We introduce and study the problem \mpd, which asks for two planar graphs $G_1$ and $G_2$ whether $G_1$ can be embedded such that its dual is isomorphic to $G_2$. Our algorithmic main result is an NP-completeness proof for the general case…

Data Structures and Algorithms · Computer Science 2013-03-08 Patrizio Angelini , Thomas Bläsius , Ignaz Rutter

Let $\Gamma$ be a $T$-ideal of identities of an affine PI-algebra over an algebraically closed field $F$ of characteristic zero. Consider the family $\mathcal{M}_{\Gamma}$ of finite dimensional algebras $\Sigma$ with $Id(\Sigma) = \Gamma$.…

Rings and Algebras · Mathematics 2023-11-22 Eli Aljadeff , Yakov Karasik

The 1970s conjecture of Lov\'asz and Plummer that the number of perfect matchings in any $3$-regular graph is exponential in the number of vertices was proved in 2011 by Esperet, Kardo\v{s}, King, Kr\'al', and Norine. We give the exact…

Combinatorics · Mathematics 2020-03-26 R. S. Lekshmi , Douglas B. West

Let G(d,n) denote the Grassmannian of d-planes in C^n and let T be the torus (C^*)^n/diag(C^*) which acts on G(d,n). Let x be a point of G(d,n) and let \bar{Tx} be the closure of the T-orbit through x. Then the class of the structure sheaf…

Algebraic Geometry · Mathematics 2007-05-23 David E Speyer

Given a quasi-split connected reductive $\mathbb{R}$-group $G$ and a finite group $A$ acting on $G$ by $\mathbb{R}$-automorphisms that preserve an $\mathbb{R}$-pinning, we construct for each discrete $L$-parameter for $G$ a corresponding…

Representation Theory · Mathematics 2026-05-11 Tasho Kaletha , Paul Mezo

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

Symplectic Geometry · Mathematics 2021-07-12 Byung Hee An , Youngjin Bae , Eunjeong Lee

We characterize all pairs of completely multiplicative functions $f,g:\mathbb{N}\to\mathbb{T}$ such that the orbit closure \[\overline{\{(f(n),g(n+1))\}_{n\ge 1}} \neq \mathbb{T}\times \mathbb{T}.\] In so doing, we settle an old conjecture…

Number Theory · Mathematics 2020-03-18 Oleksiy Klurman , Alexander P. Mangerel

Inspired by recent work of Aslanyan and Daw, we introduce the notion of $\Sigma$-orbits in the general framework of distinguished categories. In the setting of connected Shimura varieties, this concept contains many instances of…

Number Theory · Mathematics 2025-02-11 Fabrizio Barroero , Gabriel Andreas Dill

We address the open problem of existence of singularities for the complex Ginzburg-Landau equation. Using a combination of rigourous results and numerical computations, we describe a countable family of self-similar singularities. Our…

Analysis of PDEs · Mathematics 2007-05-23 Petr Plechac , Vladimir Sverak

Binary Sidel'nikov-Lempel-Cohn-Eastman sequences (or SLCE sequences) over F 2 have even period and almost perfect autocorrelation. However, the evaluation of the linear complexity of these sequences is really difficult. In this paper, we…

Information Theory · Computer Science 2017-02-21 Qi Zhang , Jing Yang

The paper deals with group dualities. A group duality is simply a pair $(G, H)$ where $G$ is an abstract abelian group and $H$ a subgroup of characters defined on $G$. A group topology $\tau$ defined on $G$ is {\it compatible} with the…

General Topology · Mathematics 2021-06-11 Tayomara Borsich , Xabier Domínguez , Elena Martín-Peinador

In this paper we study pseudorandomness of a family of sequences in terms of two measures, the family complexity ($f$-complexity) and the cross-correlation measure of order $\ell$. We consider sequences not only on binary alphabet but also…

Information Theory · Computer Science 2024-05-08 Kenan Doğan , Murat Şahin , Oğuz Yayla