Results 81 to 90 of about 654,082 (251)

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

open access: yesJournal 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   +2 more
doaj   +1 more source

Representations of reductive normal algebraic monoids

open access: yes, 2014
The rational representation theory of a reductive normal algebraic monoid (with one-dimensional center) forms a highest weight category, in the sense of Cline, Parshall, and Scott.
D.J. Grigor’ev   +7 more
core   +1 more source

Modeling (∞,1)$(\infty,1)$‐categories with Segal spaces

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 1, January 2026.
Abstract In this paper, we construct a model structure for (∞,1)$(\infty,1)$‐categories on the category of simplicial spaces, whose fibrant objects are the Segal spaces. In particular, we show that it is Quillen equivalent to the models of (∞,1)$(\infty,1)$‐categories given by complete Segal spaces and Segal categories.
Lyne Moser, Joost Nuiten
wiley   +1 more source

Canonical forms of oriented matroids

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 1, January 2026.
Abstract Positive geometries are semialgebraic sets equipped with a canonical differential form whose residues mirror the boundary structure of the geometry. Every full‐dimensional projective polytope is a positive geometry. Motivated by the canonical forms of polytopes, we construct a canonical form for any tope of an oriented matroid inside the Orlik–
Christopher Eur, Thomas Lam
wiley   +1 more source

Extremal Permanents of Laplacian Matrices of Unicyclic Graphs

open access: yesAxioms
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   +2 more
doaj   +1 more source

The dimension of well approximable numbers

open access: yesJournal of the London Mathematical Society, Volume 113, Issue 1, January 2026.
Abstract In this survey article, we explore a central theme in Diophantine approximation inspired by a celebrated result of Besicovitch on the Hausdorff dimension of well approximable real numbers. We outline some of the key developments stemming from Besicovitch's result, with a focus on the mass transference principle, ubiquity and Diophantine ...
Victor Beresnevich, Sanju Velani
wiley   +1 more source

Linking Bipartiteness and Inversion in Algebra via Graph-Theoretic Methods and Simulink

open access: yesComplexity
Research for decades has concentrated on graphs of algebraic structures, which integrate algebra and combinatorics in an innovative way. The goal of this study is to characterize specific aspects of bipartite and inverse graphs that are associated with ...
Mohammad Mazyad Hazzazi   +5 more
doaj   +1 more source

On Spectral Graph Determination

open access: yesMathematics
The study of spectral graph determination is a fascinating area of research in spectral graph theory and algebraic combinatorics. This field focuses on examining the spectral characterization of various classes of graphs, developing methods to construct ...
Igal Sason   +3 more
doaj   +1 more source

Truncated determinants and the refined enumeration of Alternating Sign Matrices and Descending Plane Partitions [PDF]

open access: yes, 2012
Lecture notes for the proceedings of the workshop "Algebraic Combinatorics related to Young diagram and statistical physics", Aug.
Di Francesco, Philippe
core  

Home - About - Disclaimer - Privacy