Results 11 to 20 of about 269,920 (285)
Mathematical Structure of Discrete Space-time [PDF]
In this letter we briefly investigate the mathematical structure of space-time in the framework of discretization. It is shown that the discreteness of space-time may result in a new mechanical system which differ from the usual quantum mechanics (QM).
An-Wei Zhang
arxiv +3 more sources
Discrete mathematics as a precursor to programming [PDF]
Peter Henderson
openalex +3 more sources
Evaluating discrete mathematics exercises [PDF]
Ann E. Fleury
openalex +2 more sources
On minimum intersections of certain secondary dominating sets in graphs [PDF]
In this paper we consider secondary dominating sets, also named as \((1,k)\)-dominating sets, introduced by Hedetniemi et al. in 2008. In particular, we study intersections of the \((1,1)\)-dominating sets and proper \((1,2)\)-dominating sets.
Anna Kosiorowska+2 more
doaj +1 more source
$L^p$-$L^q$ Boundedness of Spectral Multipliers of the Anharmonic Oscillator
In this note we study the $L^p-L^q$ boundedness of Fourier multipliers of anharmonic oscillators, and as a consequence also of spectral multipliers, for the range ...
Chatzakou, Marianna, Kumar, Vishvesh
doaj +1 more source
Decomposing 10-Regular Graphs into Paths of Length 5
Let G be a 10-regular graph which does not contain any 4-cycles. In this paper, we prove that G can be decomposed into paths of length 5, such that every vertex is a terminal of exactly two paths.
Xie Mengmeng, Zhou Chuixiang
doaj +1 more source
Time-stage driven pathfinding framework for optimized medical treatments
Coming up with the correct patient-specific treatment procedure is a non-trivial task. One of the main challenges is that the problem is combinatorial, and each treatment can be followed by numerous treatments.
Karen Gishyan+2 more
doaj +1 more source
Local irregularity conjecture for 2-multigraphs versus cacti [PDF]
A multigraph is locally irregular if the degrees of the end-vertices of every multiedge are distinct. The locally irregular coloring is an edge coloring of a multigraph \(G\) such that every color induces a locally irregular submultigraph of \(G\).
Igor Grzelec, Mariusz Woźniak
doaj +1 more source
In addition to wirelength and area, modern floorplans need to consider various constraints such as fixed-outline. To handle the fixed-outline floorplanning optimization problem efficiently, we propose an improved simulated annealing (SA) algorithm, which
Zhipeng Huang+3 more
doaj +1 more source
In this volume, the authors present a self-contained introduction to discrete mathematics – the science of finite and countably infinite structures. In addition to taking a theoretical approach, they also include many practical exercises. The text covers a broad range of topics such as propositional logic, set theory as well as detailed treatments of ...
Boschini, Cecilia+2 more
openaire +2 more sources