Results 31 to 40 of about 184,466 (302)
, 2006 "[M]athematicians care no more for logic than logicians for mathematics." Augustus de Morgan, 1868. Proofs are traditionally syntactic, inductively generated objects.
Hughes, Dominic
core +4 more sources
Average-case analysis of perfect sorting by reversals (Journal Version) [PDF]
, 2011 Perfect sorting by reversals, a problem originating in computational genomics, is the process of sorting a signed permutation to either the identity or to the reversed identity permutation, by a sequence of reversals that do not break any common interval.
Bouvel, Mathilde +3 more
core +3 more sources
On the enumeration of uniquely reducible double designs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A double $2$-$(v,k,2 \lambda)$ design is a design which is reducible into two $2$-$(v,k,\lambda)$ designs. It is called uniquely reducible if it has, up to equivalence, only one reduction.
Veerle Fack +2 more
doaj +1 more source
Subdivision of graphs in R(mK2,P4)
Heliyon, 2020 For any graphs F,G, and H, the notation F→(G,H) means that any red-blue coloring of all edges of F will contain either a red copy of G or a blue copy of H. The set R(G,H) consists of all Ramsey (G,H)-minimal graphs, namely all graphs F satisfying F→(G,H)
Kristiana Wijaya +3 more
doaj +1 more source
Restricted Stirling permutations
, 2016 In this paper, we study the generating functions for the number of pattern restricted Stirling permutations with a given number of plateaus, descents and ascents.
Callan, David +2 more
core +1 more source
The locating-chromatic number for Halin graphs
Communications in Combinatorics and Optimization, 2017 Let $G$ be a connected graph. Let $f$ be a proper $k$-coloring of $G$ and $\Pi=\{R_1,R_2,\ldots, R_k\}$ be an ordered partition of $V(G)$ into color classes. For any vertex $v$ of $G,$ define the {\em color code} $c_\Pi(v)$ of $v$ with respect to $\
I.A. Purwasih +4 more
doaj +1 more source
Automata in SageMath---Combinatorics meet Theoretical Computer Science
, 2016 The new finite state machine package in the mathematics software system SageMath is presented and illustrated by many examples. Several combinatorial problems, in particular digit problems, are introduced, modeled by automata and transducers and solved ...
Heuberger, Clemens +2 more
core +1 more source
Machine learning‐based scheduling: a bibliometric perspective
IET Collaborative Intelligent Manufacturing, 2021 In recent years, the rapid development of artificial intelligence and data science has given rise to the study of data driven algorithms in highly volatile systems. The scheduling of complex shop floor resources falls into such a category, which is often
Shiyun Li +6 more
doaj +1 more source
Time after time – circadian clocks through the lens of oscillator theory
FEBS Letters, EarlyView.Oscillator theory bridges physics and circadian biology. Damped oscillators require external drivers, while limit cycles emerge from delayed feedback and nonlinearities. Coupling enables tissue‐level coherence, and entrainment aligns internal clocks with environmental cues.
Marta del Olmo +2 more
wiley +1 more source
On distance labelings of 2-regular graphs
Electronic Journal of Graph Theory and Applications, 2021 Let G be a graph with |V(G)| vertices and ψ : V(G) → {1, 2, 3, ... , |V(G)|} be a bijective function. The weight of a vertex v ∈ V(G) under ψ is wψ(v) = ∑u ∈ N(v)ψ(u). The function ψ is called a distance magic labeling of G, if wψ(v) is a constant for
Anak Agung Gede Ngurah +1 more
doaj +1 more source