Results 131 to 140 of about 235,748 (327)
Decomposition spaces in combinatorics [PDF]
, 2016 A decomposition space (also called unital 2-Segal space) is a simplicial object satisfying an exactness condition weaker than the Segal condition: just as the Segal condition expresses (up to homotopy) composition, the new condition expresses ...
Gálvez Carrillo, Maria Immaculada +2 more
core +1 more source
A focal boundary value problem for difference equations
International Journal of Mathematics and Mathematical Sciences, 1993 The eigenvalue problem in difference equations, (−1)n−kΔny(t)=λ∑i=0k−1pi(t)Δiy(t), with Δty(0)=0, 0≤i≤k, Δk+iy(T+1)=0, 0 ...
Cathryn Denny, Darrel Hankerson
doaj +1 more source
Algebraic and geometric methods in enumerative combinatorics [PDF]
arXiv, 2014 A survey written for the upcoming "Handbook of Enumerative Combinatorics".
arxiv
Effects of altitude and exercise intensity on cardiac function in rats
Experimental Physiology, EarlyView.Abstract High‐altitude exercise affects cardiac function. This study investigated how altitude and exercise intensity interacted to affect cardiac function of Sprague‐Dawley rats. Four altitudes (410, 3600, 4600 and 5600 m) and three exercise intensities (non‐exercise (N), low‐intensity exercise (L) and high‐intensity exercise (H)) were tested ...
Minxia Zhu +7 more
wiley +1 more source
Conflict-Free Vertex-Connections of Graphs
Discussiones Mathematicae Graph Theory, 2020 A path in a vertex-colored graph is called conflict-free if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be conflict-free vertex-connected if any two vertices of the graph are connected by a conflict-free path ...
Li Xueliang +5 more
doaj +1 more source
The many faces of modern combinatorics [PDF]
arXiv, 2015 This is a survey of recent developments in combinatorics. The goal is to give a big picture of its many interactions with other areas of mathematics, such as: group theory, representation theory, commutative algebra, geometry (including algebraic geometry), topology, probability theory, and theoretical computer science.
arxiv
On the combinatorics of plethysm
Journal of Combinatorial Theory, Series A, 1987 AbstractWe construct three (large, reduced) incidence algebras whose semigroups of multiplicative functions, under convolution, are anti-isomorphic, respectively, to the semigroups of what we call partitional, permutational and exponential formal power series without constant term, in infinitely many variables x = (x1, x2,…), under plethysm. We compute
openaire +2 more sources
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
AKCE International Journal of Graphs and Combinatorics, 2020 I have known Lowell Beineke for almost fifty years. Our first joint paper, on edge-colorings of graphs, was initiated in 1971, and since then we have produced further articles and nine books on graph theory, with another two books currently in progress ...
Robin Wilson
doaj +1 more source