Results 131 to 140 of about 221,378 (266)
Short survey about combinatorics on words and algorithmic methods in a ring (draft) [PDF]
arXiv, 2016 A short survey about combinatorics on words and algorithmic methods in a ring. Special attention is given to Shirshov's results. Adopted for undegraduate students.
arxiv
Coloring Graphs With Forbidden Almost Bipartite Subgraphs
Random Structures &Algorithms, Volume 66, Issue 4, July 2025.ABSTRACT Alon, Krivelevich, and Sudakov conjectured in 1999 that for every finite graph F$$ F $$, there exists a quantity c(F)$$ c(F) $$ such that χ(G)≤(c(F)+o(1))Δ/logΔ$$ \chi (G)\le \left(c(F)+o(1)\right)\Delta /\mathrm{log}\Delta $$ whenever G$$ G $$ is an F$$ F $$‐free graph of maximum degree Δ$$ \Delta $$. The largest class of connected graphs F$$
James Anderson +2 more
wiley +1 more source
Combinatorics in the Art of the Twentieth Century [PDF]
, 2017 This paper is motivated by a question I asked myself: How can combinatorial structures be used in a work of art? Immediately, other questions arose: Whether there are artists that work or think combinatorially?
Barrière Figueroa, Eulalia
core
Complexity problems in enumerative combinatorics [PDF]
arXiv, 2018 We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.
arxiv
Arithmetic constants for symplectic variances of the divisor function
Mathematika, Volume 71, Issue 3, July 2025.Abstract Kuperberg and Lalín stated some conjectures on the variance of certain sums of the divisor function dk(n)$d_k(n)$ over number fields, which were inspired by analogous results over function fields proven by the authors. These problems are related to certain symplectic matrix integrals. While the function field results can be directly related to
Vivian Kuperberg, Matilde Lalín
wiley +1 more source
Enumeration of three term arithmetic progressions in fixed density sets [PDF]
, 2014 Additive combinatorics is built around the famous theorem by Szemer\'edi which asserts existence of arithmetic progressions of any length among the integers. There exist several different proofs of the theorem based on very different techniques.
Sjöland, Erik
core
Applied Research, Volume 4, Issue 3, June 2025.The development of a nanobody for Nogo‐A, a potent neurite outgrowth inhibitor crucial in multiple sclerosis, is reported using a rational design approach. The nanobody targets the Nogo‐A ectodomain at the S1PR2 receptor‐binding region with submicromolar KD.
Vaidehi Roy Chowdhury +9 more
wiley +1 more source
Sparse graph signals – uncertainty principles and recovery
GAMM-Mitteilungen, Volume 48, Issue 2, June 2025.ABSTRACT We study signals that are sparse either on the vertices of a graph or in the graph spectral domain. Recent results on the algebraic properties of random integer matrices as well as on the boundedness of eigenvectors of random matrices imply two types of support size uncertainty principles for graph signals.
Tarek Emmrich +2 more
wiley +1 more source
Invariants of finite groups and their applications to combinatorics [PDF]
, 1979 Richard P. Stanley
openalex +1 more source