850 results for sufficient · 0.095s

arxiv.org/abs/2301.11492v1

Recovering utility

We provide sufficient conditions under which a utility function may be recovered from a finite choice experiment. Identification, as is commonly understood in decision theory, is not enough. We provide a general recoverability result that is widely a...

Sponsored Partners
arxiv.org/abs/math/0102215v1

A correction to a result of B. Maier

In a 1985 paper, Berthold J. Maier gave necessary and sufficient conditions for the weak embeddability of amalgams of two nilpotent groups of class two over a common subgroup. Then he derived simpler conditions for some special cases. One of his su...

www.bing.com/ck/a?!&&p=99b32176c5ffefc7590cd483bb3adb02b1777ce2cc3ec5833c76d2e2a4c2f12bJmltdHM9MTc3MjQ5NjAwMA&ptn=3&ver=2&hsh=4&fclid=32505460-d415-63af-2045-4372d53b621e&u=a1aHR0cHM6Ly93d3cuZ3VuYW5kZ2FtZS5jb20vdGhyZWFkcy8zMDgtYmlnLWVub3VnaC1mb3Itc2F5LWdyaXp6bHkuMTE2MTk3Lw&ntb=1

.308 big enough for say....Grizzly??? | Gun and Game Forum

Jan 16, 2011 · And you want a gun that will do it from sufficiently far away that Mister Grizz won't take exception to being killed and live long enough to close in and kill the shooter before he finally admits …

en.wikipedia.org/wiki/List_of_feeding_behaviours

List of feeding behaviours - Wikipedia

sources, because the species is behaviourally sufficiently flexible. Some animals exhibit hoarding and caching behaviours in which they store or hide food

www.bing.com/ck/a?!&&p=24ca8d7deae677dbff16dd1bc4e76d1071cb94dab2cd9d84acf212c538bbbf81JmltdHM9MTc3MjQ5NjAwMA&ptn=3&ver=2&hsh=4&fclid=341df92c-b5e4-69fc-06ee-ee3eb4ce6812&u=a1aHR0cHM6Ly93d3cuZGVmaW5pdGlvbnMubmV0L2RlZmluaXRpb24vcHJlc3VtZQ&ntb=1

What does presume mean? - Definitions.net

To presume means to suppose or assume something to be true without having sufficient proof or evidence to confirm it. It can also refer to taking for granted that something exists or is the case.

arxiv.org/abs/1308.2358v2

Proof of a conjecture of Stanley-Zanello

We prove that the number of partitions of an integer into at most b distinct parts of size at most n forms a unimodal sequence for n sufficiently large with respect to b. This resolves a recent conjecture of Stanley and Zanello....

arxiv.org/abs/2503.07925v1

Generalizations of Total Dual Integrality

We design new tools to study variants of Total Dual Integrality. As an application, we obtain a geometric characterization of Total Dual Integrality for the case where the associated polyhedron is non-degenerate. We also give sufficient conditions fo...

arxiv.org/abs/0704.0492v2

Refuting the Pseudo Attack on the REESSE1+ Cryptosystem

We illustrate through example 1 and 2 that the condition at theorem 1 in [8] dissatisfies necessity, and the converse proposition of fact 1.1 in [8] does not hold, namely the condition Z/M - L/Ak < 1/(2 Ak^2) is not sufficient for f(i) + f(j) = f(k...

arxiv.org/abs/1203.5349v1

LOCKE Detailed Specification Tables

This document shows the detailed specification of LOCKE coherence protocol for each cache controller, using a table-based technique. This representation provides clear, concise visual information yet includes sufficient detail (e.g., transient states...

arxiv.org/abs/1311.3679v1

Partitions of unity and coverings

The aim of this paper is to prove all well-known metrization theorems using partitions of unity. To accomplish this, we first discuss sufficient and necessary conditions for existence of $\mathcal{U}$-small partitions of unity (partitions of unity su...

en.wikipedia.org/wiki/Vaping-associated_pulmonary_injury

Vaping-associated pulmonary injury - Wikipedia

sufficient to rule out the contribution of other chemicals of concern, including chemicals in either THC or non-THC products, in some of the reported

arxiv.org/abs/2510.25165v2

Most Juntas Saturate the Hardcore Lemma

Consider a function that is mildly hard for size-$s$ circuits. For sufficiently large $s$, Impagliazzo's hardcore lemma guarantees a constant-density subset of inputs on which the same function is extremely hard for circuits of size $s'<\!\!<s$. Blan...

arxiv.org/abs/1309.2621v12

Multiple Collisions in Systems of Competing Brownian Particles

Consider a finite system of competing Brownian particles on the real line. Each particle moves as a Brownian motion, with drift and diffusion coefficients depending only on its current rank relative to the other particles. We find a sufficient condit...