Results 1 to 10 of about 6,245,930 (246)
Robin Criterion on Divisibility [PDF]
The Ramanujan Journal, 2021 Robin criterion states that the Riemann Hypothesis is true if and only if the inequality $\sigma(n) < e^{\gamma } \times n \times \log \log n$ holds for all $n > 5040$, where $\sigma(n)$ is the sum-of-divisors function and $\gamma \approx 0.57721$ is the Euler-Mascheroni constant. This is known as the Robin inequality.
openaire +17 more sources
, 2014 An LDB division algebra is a triple $(A,\star,\bullet)$ in which $\star$ and $\bullet$ are regular bilinear laws on the finite-dimensional non-zero vector space $A$ such that $x \star (x \bullet y)$ is a scalar multiple of $y$ for all vectors $x$ and $y$
Pazzis, Clément de Seguins
core +2 more sources
The complexity of divisibility
Linear Algebra and its Applications, 2016 We address two sets of long-standing open questions in probability theory, from a computational complexity perspective: divisibility of stochastic maps, and divisibility and decomposability of probability distributions. We prove that finite divisibility of stochastic maps is an NP-complete problem, and extend this result to nonnegative matrices, and ...
Bausch, Johannes, Cubitt, Toby
openaire +5 more sources
Perfect divisibility and 2‐divisibility
Journal of Graph Theory, 2018 AbstractA graph G is said to be 2‐divisible if for all (nonempty) induced subgraphs H of G, can be partitioned into two sets such that and . (Here denotes the clique number of G, the number of vertices in a largest clique of G). A graph G is said to be perfectly divisible if for all induced subgraphs H of G, can be partitioned into two sets such ...
Maria Chudnovsky, Vaidy Sivaraman
openaire +3 more sources
Colony size predicts division of labour in Attine ants [PDF]
, 2014 Division of labour is central to the ecological success of eusocial insects, yet the evolutionary factors driving increases in complexity in division of labour are little known.
Alexander RD +10 more
core +2 more sources
Psychiatric Bulletin, 1980 The Summer Quarterly Meeting of the Irish Division took place in St Brendan's Hospital, Dublin, on 2 July 1982.
openaire +6 more sources
On Exact Division and Divisibility Testing for Sparse Polynomials [PDF]
Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation, 2021 No polynomial-time algorithm is known to test whether a sparse polynomial G divides another sparse polynomial $F$. While computing the quotient Q=F quo G can be done in polynomial time with respect to the sparsities of F, G and Q, this is not yet sufficient to get a polynomial-time divisibility test in general.
Giorgi, Pascal +2 more
openaire +4 more sources
Chimères, 1999 Bonnefoi Christian, Zerbib Monique. Division de la division. In: Chimères. Revue des schizoanalyses, N°37, automne 1999. Gilles et Félix sur le fil du rasoir. pp. 69-78.
Bonnefoi, Christian, Zerbib, Monique
openaire +2 more sources
AoB PLANTS, 2010 Plastids undergo a process of binary fission in order to replicate. Plastid replication is required at two distinct stages of plant growth: during cell division to ensure correct plastid segregation, and during cell expansion and development to generate large populations of functional plastids, as in leaf mesophyll cells.
openaire +2 more sources
Fair Division with Subjective Divisibility
, 2023 The classic fair division problems assume the resources to be allocated are either divisible or indivisible, or contain a mixture of both, but the agents always have a predetermined and uncontroversial agreement on the (in)divisibility of the resources.
Bei, Xiaohui, Liu, Shengxin, Lu, Xinhang
openaire +2 more sources