Results 11 to 20 of about 1,150 (221)
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.
Pascal Giorgi +2 more
openaire +3 more sources
Fair Division of Mixed Divisible and Indivisible Goods [PDF]
Proceedings of the AAAI Conference on Artificial Intelligence, 2020 We study the problem of fair division when the resources contain both divisible and indivisible goods. Classic fairness notions such as envy-freeness (EF) and envy-freeness up to one good (EF1) cannot be directly applied to the mixed goods setting. In this work, we propose a new fairness notion envy-freeness for mixed goods (EFM), which is a direct ...
Xiaohui Bei +4 more
openaire +4 more sources
Mathematics in Computer Science, 2018 To appear in Mathematics in Computer ...
Nello Blaser, Morten Brun
openaire +2 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 +4 more sources
Congruences Module m and its Applications and Diophantine Equations [PDF]
Científica, 2023 A method of analysis of two topics of the theory of numbers, the congruences modulo m and the Diophantine equations, is developed; the first referred to the divisibility between numbers, and the second to the solution of equations with integer ...
Mario Antonio Ramírez Flores +1 more
doaj +1 more source
The Proof of a Conjecture on the Density of Sets Related to Divisibility Properties of z(n)
Mathematics, 2021 Let (Fn)n be the sequence of Fibonacci numbers. The order of appearance (in the Fibonacci sequence) of a positive integer n is defined as z(n)=min{k≥1:n∣Fk}.
Eva Trojovská, Venkatachalam Kandasamy
doaj +1 more source
Arithmetical Functions Associated with the k-ary Divisors of an Integer
International Journal of Mathematics and Mathematical Sciences, 2018 The k-ary divisibility relations are a class of recursively defined relations beginning with standard divisibility and culminating in the so-called infinitary divisibility relation.
Joseph Vade Burnett +4 more
doaj +1 more source
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
One more time about the relation between morphemic analysis and word-formation analysis [PDF]
Južnoslovenski Filolog, 2019 One of the basic criteria when it comes to describing the surface structure of the derivative lexical units is distinguishing morphemic and word-formation analysis.
Baltova Yuliya M.
doaj +1 more source
A product autoregressive model with log-Laplace marginal distribution
Statistica, 2013 The log-Laplace distribution and its properties are considered. Some important properties like multiplicative infinite divisibility, geometric multiplicative infinite divisibility and self-decomposability are discussed.
Kanichukattu K. Jose, Manu Mariam Thomas
doaj +1 more source