Results 61 to 70 of about 56,560 (166)

Zarankiewicz bounds from distal regularity lemma

Bulletin of the London Mathematical Society, Volume 58, Issue 3, March 2026.
Abstract Since Kővári, Sós and Turán proved upper bounds for the Zarankiewicz problem in 1954, much work has been undertaken to improve these bounds, and some have done so by restricting to particular classes of graphs. In 2017, Fox, Pach, Sheffer, Suk and Zahl proved better bounds for semialgebraic binary relations, and this work was extended by Do in
Mervyn Tong
wiley   +1 more source

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

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

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

Asymmetric function theory

, 2019
The classical theory of symmetric functions has a central position in algebraic combinatorics, bridging aspects of representation theory, combinatorics, and enumerative geometry.
Allen Hatcher, Anders Skovsted Buch, Andrew Baker, B Yasmine, Bogdan Ion, C Lenart, Daniel Bump, David Anderson, E Dudley, Eric Opdam, Hugh Thomas, J Haglund, J Haglund, Masaki Kashiwara, Masaki Kashiwara, Masaki Kashiwara, Masaki Watanabe, Masaki Watanabe, Michiel Hazewinkel, N Ganter, Nantel Bergeron, Oliver Pechenik, Paul Bressler, Pavel Galashin, PN Norton, Rudolf Winkel, S Assaf, S Assaf, S Mason, Sara C Billey, Sergey Fomin, Thomas Hudson, V Reiner, Vasu V Tewari, W George, William Fulton, Witold Kraśkiewicz   +36 more
core   +1 more source

Small triangles

Journal of the London Mathematical Society, Volume 113, Issue 3, March 2026.
Abstract Heilbronn's triangle problem is a classical question in discrete geometry. It asks to determine the smallest number Δ=Δ(N)$\Delta = \Delta (N)$ for which every collection in N$N$ points in the unit square spans a triangle with area at most Δ$\Delta$.
Dmitrii Zakharov
wiley   +1 more source

Pairwise Well-Formed Modes and Transformations

, 2017
One of the most significant attitudinal shifts in the history of music occurred in the Renaissance, when an emerging triadic consciousness moved musicians towards a new scalar formation that placed major thirds on a par with perfect fifths. In this paper
D Clampitt, J Nielsen, M Lothaire, N Carey, N Carey, T Noll, V Berthé, W Magnus   +7 more
core   +1 more source

Connected components of the space of flags of SO0(p,q)$\operatorname{SO}_0(p,q)$ transverse to a fixed pair and restrictions on Anosov subgroups

Journal of the London Mathematical Society, Volume 113, Issue 3, March 2026.
Abstract We count and give a parametrization of connected components in the space of flags transverse to a given transverse pair in every flag varieties of SO0(p,q)$\operatorname{SO}_0(p,q)$. We compute the effect the involution of the unipotent radical has on those components and, using methods of Dey–Greenberg–Riestenberg, we show that for certain ...
Clarence Kineider, Roméo Troubat
wiley   +1 more source

On Spectral Graph Determination

Mathematics
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, Noam Krupnik, Suleiman Hamud, Abraham Berman   +3 more
doaj   +1 more source

Bayer noise quasisymmetric functions and some combinatorial algebraic structures [PDF]

Categories and General Algebraic Structures with Applications
Recently, quasisymmetric functions have been widely studied due to their big connection to enumerative combinatorics, combinatorial Hopf algebra and number theory.
Adnan Abdulwahid
doaj   +1 more source

Sorting probability for large Young diagrams

Discrete Analysis, 2021
Sorting probability for large Young diagrams, Discrete Analysis 2021:24, 57 pp. Let $P=(X,\leq_P)$ be a finite partially ordered set (or _poset_, for short). A _linear extension_ $L$ of $P$ is a total ordering $\leq_L$ on $X$ such that for every $x,y\in
Swee Hong Chan, Igor Pak, Greta Panova
doaj   +1 more source