Results 61 to 70 of about 10,716 (231)
Cytoskeleton, EarlyView.ABSTRACT Post‐translational modifications (PTMs) to tubulin subunits in microtubule filaments are thought to comprise a component of the tubulin code that specifies microtubule functions in cell physiology and animal development. Acetylation of Lysine‐40 (K40) on α‐tubulin (αTub‐K40ac) and glutamylation of both α‐ and β‐tubulin are two tubulin PTMs of ...
Lynne Blasius +6 more
wiley +1 more source
, 2015 The 3n+ 1 Problem posed by Lothar Collatz. The 3n+ 1 problem is concerned with the iteration sequence of the function that takes positive odd integers (See more in text.
Ngo, Evelyn
core
Signed Projective Cubes, a Homomorphism Point of View
Journal of Graph Theory, EarlyView.ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen +2 more
wiley +1 more source
On Tight Tree‐Complete Hypergraph Ramsey Numbers
Journal of Graph Theory, EarlyView.ABSTRACT Chvátal showed that for any tree T $T$ with k $k$ edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1 $R(T,n)=k(n-1)+1$. For r = 3 $r=3$ or 4, we show that, if T $T$ is an r $r$‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ) $R(T,n)={\rm{\Theta }}({n}^{r-1})$.
Jiaxi Nie
wiley +1 more source
Three Persons Satisfactory Roommates Problem
Communications on Applied Nonlinear AnalysisThe Satisfactory Roommates Problem (SFRP) is the problem of finding satisfactory matching between any pair of roommates. In the SFRP, each person in the set of even cardinality 2n rank the 2n-1 others in order of preference.
N. Logapriya
semanticscholar +1 more source
, 2011 SequencesThe Collatz sequence is built starting from the number n. If n is even, compute n/2; if n is odd, compute 3n+1. Repeat using the result. Here these sequences are shown using red spheres for even numbers and blue ones for odd numbers. Does this
Zizi, Jacqueline
core +1 more source
Advances in Nonlinear AnalysisIn this article, we consider the existence and nonexistence of positive solutions for the following critical Neumann problem: −Δpu+λup−1=up*−1+f(x,u),x∈Ω;∣∇u∣p−2∇u⋅ν=up♯−1,x∈∂Ω,\left\{\begin{array}{ll}-{\Delta }_{p}u+\lambda {u}^{p-1}={u}^{{p}^{* }-1}+f ...
Deng Yinbin, Shi Yulin, Xu Liangshun
doaj +1 more source
The 3n+1 Problem: A Probabilistic Approach [PDF]
, 2014 The Poisson probability distribution is used to model the number of cycles in the generalized Collatz problem. First, interrelated cycles are defined and used as a criterion in counting the cycles for a given q value.
Darrell Cox
core
Quantum Humeanism, or: physicalism without properties [PDF]
, 2014 In recent literature, it has become clear that quantum physics does not refute Humeanism: Lewis’s thesis of Humean supervenience can be literally true even in the light of quantum entanglement.
Michael Esfeld, Esfeld, Michael
core +1 more source
Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w ) $G=(V,E,w)$ has a bisection with weight at least θ ⋅ w (
Stefanie Gerke +3 more
wiley +1 more source