Results 101 to 110 of about 144,275 (215)
Combinatorics of Free Cumulants
Journal of Combinatorial Theory, Series A, 2000 26 pages ...
Bernadette Krawczyk, Roland Speicher
openaire +3 more sources
Sections and projections of the outer and inner regularizations of a convex body
Mathematika, Volume 72, Issue 3, July 2026.Abstract We establish new geometric inequalities comparing the volumes of sections and projections of a convex body, whose barycenter or Santaló point is at the origin, with those of its inner and outer regularizations. We also provide functional extensions of these inequalities to the setting of log‐concave functions. Our approach relies on the recent
Natalia Tziotziou
wiley +1 more source
Determinants, choices and combinatorics [PDF]
Discrete Mathematics, 2019 We prove a formula which generalizes both Onn's colorful determinantal formula, related to Rota's basis conjecture, and Svrtan's $n!$ formula, related to the Atiyah-Sutcliffe problem. In some cases, our formula allows us to prove some results similar in spirit to the statement of Rota's basis conjecture.
openaire +2 more sources
International Journal of Applied Psychoanalytic Studies, Volume 23, Issue 2, June 2026.ABSTRACT This article offers a theoretical analysis, grounded in a critical narrative review within the Freudian‐Lacanian tradition, of how platform algorithms shape contemporary forms of subjectivity and raise new questions for psychoanalytic practice.
Mariana Salles Kehl, Heloisa Caldas
wiley +1 more source
Properly Colored Cycles in Edge‐Colored Balanced Bipartite Graphs
Journal of Graph Theory, Volume 112, Issue 2, Page 37-53, June 2026.ABSTRACT Let G n , n c denote a (not necessarily properly) edge‐colored balanced bipartite graph on 2 n vertices, that is, in which every edge is assigned a color. A cycle C in G n , n c is called properly colored if any two consecutive edges of C have distinct colors.
Tingting Han +3 more
wiley +1 more source
On Regular Quaternary Hadamard Matrices
Journal of Combinatorial Designs, Volume 34, Issue 5, Page 215-227, May 2026.ABSTRACT Through the use of regularizing vectors, all regular quaternary Hadamard matrices of orders 10 and 18 have been successfully identified. Of these, two matrices of order 10 and 184 matrices of order 18 were found to have unbiased mates. Converting the quaternary Hadamard matrices of order 18 to real Hadamard matrices, the study uncovered that ...
Hadi Kharaghani +2 more
wiley +1 more source
Rainbow Connection Number of Dense Graphs
Discussiones Mathematicae Graph Theory, 2013 An edge-colored graph G is rainbow connected, if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to ...
Li Xueliang +2 more
doaj +1 more source
Discrete Mathematics, 2002 This nice survey paper gives a short introduction into Daniel Kleitman's seminal contributions to combinatorics, with special emphasis on extremal hypergraph theory, asymptotic enumerations, and discrete geometry.
openaire +2 more sources
In‐and‐Out: Algorithmic Diffusion for Sampling Convex Bodies
Random Structures &Algorithms, Volume 68, Issue 3, May 2026.ABSTRACT We present a new random walk for uniformly sampling high‐dimensional convex bodies. It achieves state‐of‐the‐art runtime complexity with stronger guarantees on the output than previously known, namely in Rényi divergence (which implies TV, 𝒲2, KL, χ2$$ {\chi}^2 $$).
Yunbum Kook +2 more
wiley +1 more source
Two‐Round Ramsey Games on Random Graphs
Random Structures &Algorithms, Volume 68, Issue 3, May 2026.ABSTRACT Motivated by the investigation of sharpness of thresholds for Ramsey properties in random graphs, Friedgut, Kohayakawa, Rödl, Ruciński and Tetali introduced two variants of a single‐player game whose goal is to colour the edges of a random graph, in an online fashion, so as not to create a monochromatic triangle.
Yahav Alon +2 more
wiley +1 more source