Results 81 to 90 of about 245,402 (215)

Convergence and combinatorics of the Reverse algorithm

Bulletin of the London Mathematical Society, Volume 58, Issue 9, September 2026.
Abstract We study the Reverse algorithm, a multidimensional continued fraction algorithm, which is not unimodular. We show that the Reverse algorithm is ergodic and, by proving that its second Lyapunov exponent is negative, that it is a.e. exponentially convergent.
Hiroaki Ito, Niels Langeveld, Jörg Thuswaldner   +2 more
wiley   +1 more source

Strength and partition rank under limits and field extensions

Bulletin of the London Mathematical Society, Volume 58, Issue 9, September 2026.
Abstract The strength of a multivariate homogeneous polynomial is the minimal number of terms in an expression as a sum of products of lower‐degree homogeneous polynomials. Partition rank is the analogue for multilinear forms. Both ranks can drop under field extensions, and both can jump in a limit.
Arthur Bik, Jan Draisma, Amichai Lampert, Tamar Ziegler   +3 more
wiley   +1 more source

Graphs Connected to Isotopes of Inverse Property Quasigroups: A Few Applications

Journal of Applied Mathematics
Many real-world applications can be modelled as graphs or networks, including social networks and biological networks. The theory of algebraic combinatorics provides tools to analyze the functioning of these networks, and it also contributes to the ...
Muhammad Nadeem, Sharafat Ali, Md. Ashraful Alam   +2 more
doaj   +1 more source

Cauchy identities for staircase matrices

Journal of the London Mathematical Society, Volume 114, Issue 3, September 2026.
Abstract The well‐known Cauchy identity expresses the product of terms (1−xiyj)−1${(1-{x}_{i}{y}_{j})}^{-1}$ for (i,j)$(i,j)$ indexing entries of a rectangular m×n$m\ensuremath{\times{}}n$‐matrix as a sum over partitions λ$\lambda $ of products of Schur polynomials: sλ(x)sλ(y)${s}_{\lambda}(x){s}_{\lambda}(y)$.
Evgeny Feigin, Anton Khoroshkin, Ievgen Makedonskyi   +2 more
wiley   +1 more source

Recent progress in algebraic combinatorics [PDF]

Bulletin of the American Mathematical Society, 2002
We survey three recent breakthroughs in algebraic combinatorics. The first is the proof by Knutson and Tao, and later Derksen and Weyman, of the saturation conjecture for Littlewood-Richardson coefficients. The second is the proof of the
openaire   +2 more sources

Extremal Permanents of Laplacian Matrices of Unicyclic Graphs

Axioms
The extremal problem of Laplacian permanents of graphs is a classical and challenging topic in algebraic combinatorics, where the inherent #P-complete complexity of permanent computation renders this pursuit particularly intractable.
Tingzeng Wu, Xiuhong Wang, Xiangshuai Dong   +2 more
doaj   +1 more source

Tropical Donagi theorem

Journal of the London Mathematical Society, Volume 114, Issue 3, September 2026.
Abstract The tropical n$n$‐gonal construction was introduced in recent work by the first author and D. Zakharov and structural results for n=2,3$n = 2,3$ were established. In this paper, we explore the construction for n=4$n = 4$ and prove a tropical analogue of Donagi's theorem which states that the tetragonal construction is a triality which ...
Felix Röhrle, Thomas Saillez
wiley   +1 more source

Cartwright–Sturmfels Hilbert schemes

Journal of the London Mathematical Society, Volume 114, Issue 3, September 2026.
Abstract Let S$S$ be the Cox ring of a product of r$r$ projective spaces. In this paper, we study the Cartwright–Sturmfels Hilbert schemes of S$S$, which are multigraded Hilbert schemes that parameterize only radical ideals. Our main result shows that these Hilbert schemes are always smooth and irreducible if the Picard rank r$r$ is at most 2.
Ritvik Ramkumar, Alessio Sammartano
wiley   +1 more source

Max-algebra: the linear algebra of combinatorics?

Linear Algebra and its Applications, 2003
The paper deals with the relationship between basic max-algebraic problems and combinatorial or combinatorial optimization problems. By max-algebra the author understands the analogue of linear algebra developed for the pair of operations \((\oplus, \otimes)\) extended to matrices and vectors formally in the same way as in linear algebra.
openaire   +2 more sources

Interpolation categories for conformal embeddings

Proceedings of the London Mathematical Society, Volume 133, Issue 3, September 2026.
Abstract In this paper, we give a diagrammatic description of the categories of modules coming from the conformal embeddings V(slN,N)⊂V(soN2−1,1)$\mathcal{V}({\mathfrak{sl}}_{N},N)\subset \mathcal{V}({\mathfrak{so}}_{{N}^{2}-1},1)$. A small variant of this construction (morally corresponding to a conformal embedding of glN${\mathfrak{gl}}_{N}$ level N ...
Cain Edie‐Michell, Noah Snyder
wiley   +1 more source