Results 1 to 10 of about 985 (214)
Journal of SemanticsConditional statements often imply meanings that extend beyond their literal content, influenced by contextual factors such as the Question Under Discussion (QUD) and a speaker’s epistemic state. One such inference is Conditional Perfection (CP), wherein a statement like, “If p then q,” is strengthened to imply that the antecedent p is the only ...
Alan Bale
exaly +2 more sources
Discussiones Mathematicae Graph Theory, 2002 A \(\beta \)-perfect graph is a simple graph \(G\) such that \(\chi (G')=\beta (G')\) for every induced subgraph \(G'\) of \(G\), where \(\chi (G')\) is the chromatic number of \(G'\), and \(\beta (G')\) is defined as the maximum over all induced subgraphs \(H\) of \(G'\) of the minimum vertex degree in \(H\) plus 1 (i.e., \(\delta (H)+1\)).
Keijsper, J.C.M., Tewes, M.
openaire +4 more sources
An information theoretic necessary condition for perfect reconstruction
CoRR, 2023 27 pages, 9 ...
Idris Delsol +4 more
openaire +2 more sources
Irish Mathematical Society Bulletin, 1995 A nonsingular real matrix is said to be perfectly conditioned if its condition number is equal to one. In this paper it is shown that a nonsingular real matrix is perfectly conditioned if and only if the matrix is a nonzero scalar multiple of a norm-preserving linear operator.
openaire +2 more sources
Composite norms and perfect conditioning [PDF]
Linear and Multilinear Algebra, 2008 We study condition numbers for composite norms and analyze the situations where perfect conditioning occurs.
openaire +2 more sources
A rationality condition for the existence of odd perfect numbers [PDF]
International Journal of Mathematics and Mathematical Sciences, 2003 A rationality condition for the existence of odd perfect numbers is used to derive an upper bound for the density of odd integers such that σ(N) could be equal to 2N, where N belongs to a fixed interval with a lower limit greater than 10300. The rationality of the square root expression consisting of a product of repunits multiplied by twice the base ...
openaire +4 more sources
Neighborhood conditions and edge-disjoint perfect matchings
Discrete Mathematics, 1991 A graph \(G\) satisfies the all pairs neighborhood condition \(\text{ANC}(G)\geq m\) if, for each pair \(x,y\) of vertices of \(G\), we have \(| N_ G(x)\cup N_ G(y)|\geq m\). Let \(k\) be a fixed positive integer and \(G\) a graph of even order \(n\) which satisfies the following conditions: (1) the minimum degree of \(G\) is at least \(k+1\); (2) the ...
Ralph J. Faudree +2 more
openaire +2 more sources
Commutative Ring Extensions Defined by Perfect-Like Conditions
Ukrainian Mathematical Journal, 2023 UDC 512.5 In 2005, Enochs, Jenda, and López-Romos extended the notion of perfect rings to n -perfect rings such that a ring is n -perfect if every flat module has projective dimension less or equal than n . Later, Jhilal and Mahdou defined a commutative unital ring R to be strongly n -perfect if any R -module of flat dimension
Ismaili, K. Alaoui +2 more
openaire +2 more sources
Dynamic Incentives and Markov Perfection: Putting the 'Conditional' in Conditional Cooperation [PDF]
SSRN Electronic Journal, 2015 This paper experimentally examines the selection of equilibria in dynamic games. Our baseline treatment is a two-state extension of an indefinitely repeated prisoner’s dilemma, which we modify in series of treatments to study the focality of efficiency and symmetry, the effect dynamic and static strategic externalities, and the size of the state-space.
Emanuel Vespa, Alistair J. Wilson
openaire +3 more sources
An Information Theoretic Condition for Perfect Reconstruction
EntropyA new information theoretic condition is presented for reconstructing a discrete random variable X based on the knowledge of a set of discrete functions of X. The reconstruction condition is derived from Shannon’s 1953 lattice theory with two entropic metrics of Shannon and Rajski.
Delsol, Idris +4 more
openaire +4 more sources