Results 71 to 80 of about 270,762 (116)
arXiv, 2020 Lecture notes written for a one-semester course in mathematical relativity aimed at mathematics and physics students. Not meant as an introduction to general relativity, but rather as a complementary, more advanced text.
arxiv
Super stable tensegrities and the Colin de Verdière number ν
Journal of Graph Theory, Volume 108, Issue 3, Page 401-431, March 2025.Abstract A super stable tensegrity introduced by Connelly in 1982 is a globally rigid discrete structure made from stiff bars and struts connected by cables with tension. We introduce the super stability number of a multigraph as the maximum dimension that a multigraph can be realized as a super stable tensegrity, and show that it equals the Colin de ...
Ryoshun Oba, Shin‐ichi Tanigawa
wiley +1 more source
A Euclid style algorithm for MacMahon's partition analysis
, 2015 Solutions to a linear Diophantine system, or lattice points in a rational convex polytope, are important concepts in algebraic combinatorics and computational geometry. The enumeration problem is fundamental and has been well studied, because it has many
Aardal +24 more
core +1 more source
Basilica: New canonical decomposition in matching theory
Journal of Graph Theory, Volume 108, Issue 3, Page 508-542, March 2025.Abstract In matching theory, one of the most fundamental and classical branches of combinatorics, canonical decompositions of graphs are powerful and versatile tools that form the basis of this theory. However, the abilities of the known canonical decompositions, that is, the Dulmage–Mendelsohn, Kotzig–Lovász, and Gallai–Edmonds decompositions, are ...
Nanao Kita
wiley +1 more source
Towards Nash‐Williams orientation conjecture for infinite graphs
Journal of Graph Theory, Volume 108, Issue 3, Page 608-619, March 2025.Abstract In 1960 Nash‐Williams proved that an edge‐connectivity of 2 k is sufficient for a finite graph to have a k
wiley +1 more source
Perfect Matchings and Loose Hamilton Cycles in the Semirandom Hypergraph Model
Random Structures &Algorithms, Volume 66, Issue 2, March 2025.ABSTRACT We study the 2‐offer semirandom 3‐uniform hypergraph model on n$$ n $$ vertices. At each step, we are presented with 2 uniformly random vertices. We choose any other vertex, thus creating a hyperedge of size 3. We show a strategy that constructs a perfect matching and another that constructs a loose Hamilton cycle, both succeeding ...
Michael Molloy +2 more
wiley +1 more source
The Completion Numbers of Hamiltonicity and Pancyclicity in Random Graphs
Random Structures &Algorithms, Volume 66, Issue 2, March 2025.ABSTRACT Let μ(G)$$ \mu (G) $$ denote the minimum number of edges whose addition to G$$ G $$ results in a Hamiltonian graph, and let μ^(G)$$ \hat{\mu}(G) $$ denote the minimum number of edges whose addition to G$$ G $$ results in a pancyclic graph. We study the distributions of μ(G),μ^(G)$$ \mu (G),\hat{\mu}(G) $$ in the context of binomial random ...
Yahav Alon, Michael Anastos
wiley +1 more source
Role of Mathematics in Physical Sciences [PDF]
arXiv, 2004 The role of mathematics in physical sciences is discussed, particularly how higher mathematics found applications in empirical problems. Several examples are given to illustrate this role.
arxiv
Combinatorial Mathematical Tasks in the Education in Mathematics for Grades 1.- 4. [PDF]
, 2018 The choice of strategies and their correct combination over the course of training of the students to solve tasks from the area of combinatorics for composing combinatorial compounds from permutation type is one of the important factors for performance ...
Temnikova, Maria
core +2 more sources
A Review of Modern Multinomial‐Derived and Partition‐Based Record‐Linkage Methods
WIREs Computational Statistics, Volume 17, Issue 1, March 2025.ABSTRACT Fellegi and Sunter introduced in 1969 the first theory of record linkage. Their work was interpreted and applied in many situations. However, an infrastructure to support generalizing the theory was not available until 40 years later when Sadinle and Fienberg formally introduced partitioning in the record linkage arena.
Yves Thibaudeau
wiley +1 more source