Results 111 to 120 of about 6,526 (216)
Computing and Combinatorics [PDF]
Algorithmica, 2016 Zhipeng Cai 0001, Alexander Zelikovsky
openaire +1 more source
Advancement of Peptide‐PAINT: Applications and Current Challenges in Super‐Resolution Imaging
Small Science, Volume 6, Issue 8, August 2026.Peptide‐PAINT is rapidly emerging as a powerful single‐molecule super‐resolution imaging platform, enabling molecular visualization with ~5–10 nm localization precision. This review critically discusses its underlying principles, recent biological applications, technological limitations, and key challenges, while benchmarking its strengths and ...
Devi Prasanna Behera +3 more
wiley +1 more source
The Role of Dice in the Emergence of the Probability Calculus
International Statistical Review, Volume 94, Issue 2, Page 464-483, August 2026.Summary The early development of the probability calculus was clearly influenced by the roll of dice. However, while dice have been cast since time immemorial, documented calculations on the frequency of various dice throws date back only to the mid‐13th century.
David R. Bellhouse, Christian Genest
wiley +1 more source
The implications of generative artificial intelligence for mathematics education
School Science and Mathematics, Volume 126, Issue 4, Page 356-365, August 2026.Abstract Generative artificial intelligence has become prevalent in discussions of educational technology, particularly in the context of mathematics education. These AI models can engage in human‐like conversation and generate answers to complex questions in real‐time, with education reports accentuating their potential to make teachers' work more ...
Candace Walkington
wiley +1 more source
On a Ramsey–Turán variant of Roth's theorem
Bulletin of the London Mathematical Society, Volume 58, Issue 8, August 2026.Abstract A classical theorem of Roth states that the maximum size of a solution‐free set of a homogeneous linear equation L$\mathcal {L}$ in Fp$\mathbb {F}_p$ is o(p)$o(p)$ if and only if the sum of the coefficients of L$\mathcal {L}$ is 0. In this paper, we prove a Ramsey–Turán variant of Roth's theorem, with respect to a natural notion of “structured”
Matija Bucić +4 more
wiley +1 more source
Cutting Planes in Combinatorics
European Journal of Combinatorics, 1985 The author uses two combinatorial problems: packing diamonds into a Chinese checkerboard nd Deza's proof of a conjecture of Erdős and Lovàsz [\textit{M. Deza}, J. Comb. Theory, Ser. B, 16, 166-167 (1974; Zbl 0263.05007)] to illustrate how Gomory's cutting plane method for solving integer linear programming problems can be used to solve combinatorial ...
openaire +2 more sources
Cluster scattering diagrams via quiver moduli and tight gradings
Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.Abstract We study rank‐2 cluster scattering diagrams through moduli spaces of quiver representations and a recently developed combinatorial framework of tight gradings. Combining quiver‐theoretic and combinatorial methods, we prove and extend a collection of conjectures posed by Elgin–Reading–Stella concerning the structural and enumerative properties ...
Amanda Burcroff +4 more
wiley +1 more source
Fine multidegrees, universal Gröbner bases, and matrix Schubert varieties
Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.Abstract We give a criterion for a collection of polynomials to be a universal Gröbner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in (P1)N$(\mathbb {P}^1)^N$. This criterion can be used to give simple proofs of several existing results on universal Gröbner bases.
Daoji Huang, Matt Larson
wiley +1 more source
Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.Abstract In 1973, Erdős conjectured the existence of high girth (n,3,2)$(n,3,2)$‐Steiner systems. Recently, Glock, Kühn, Lo, and Osthus and independently Bohman and Warnke proved the approximate version of Erdős' conjecture. Recently, Kwan, Sah, Sawhney, and Simkin proved Erdős' conjecture.
Michelle Delcourt, Luke Postle
wiley +1 more source
Type C$C$ skein modules and transparent elements
Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.Abstract We study skein modules using Sp(2n)$\textit{Sp}(2n)$ webs. We define multivariable analogues of Chebyshev polynomials in the Type C$C$ setting and use them to construct transparent elements in the skein module at roots of unity. Our arguments are diagrammatic and make use of an explicit braiding formula for 1 and k$k$ labeled strands and an ...
Vijay Higgins, Haihan Wu
wiley +1 more source