Related papers: On a generalization of property B
The study of Property (B) starts as a special case of Lehmer's conjecture. An algebraic field is said to satisfy Property (B) if there exists a positive constant bounding by below the height of every point of infinite order. In this paper…
The main results of this paper show that various coarse (`large scale') geometric properties are closely related. In particular, we show that property A implies the operator norm localisation property, and thus that norms of operators…
New lower bounds involving sum, difference, product, and ratio sets for a set $A\subset \C$ are given. The estimates involving the sum set match, up to constants, the one obtained by Solymosi for the reals and are obtained by generalising…
We introduce a new consistency-based approach for defining and solving nonnegative/positive matrix and tensor completion problems. The novelty of the framework is that instead of artificially making the problem well-posed in the form of an…
Menger's basis property is a generalization of $\sigma$-compactness and admits an elegant combinatorial interpretation. We introduce a general combinatorial method to construct non $\sigma$-compact sets of reals with Menger's property.…
The Rees product of partially ordered sets was introduced by Bj\"orner and Welker. Using the theory of lexicographic shellability, Linusson, Shareshian and Wachs proved formulas, of significance in the theory of gamma-positivity, for the…
For the solvable polynomial algebras introduced and studied by Kandri-Rody and Weispfenning [J. Symbolic Comput., 9(1990)], a constructive characterization is given in terms of Gr\"obner bases for ideals of free algebras, thereby solvable…
Theory-guided machine learning has demonstrated that including authentic domain knowledge directly into model design improves performance, sample efficiency and out-of-distribution generalisation. Yet the process by which a formal domain…
A necessary and sufficient condition is provided for the solvability of a binomial congruence with a composite modulus, circumventing its prime factorization. This is a generalization of Euler's Criterion through that of Euler's Theorem,…
A theorem due to Ohkawa states that the collection of Bousfield equivalence classes of spectra is a set. We extend this result to arbitrary combinatorial model categories.
Andrew Pitts' framework of relational properties of domains is a powerful method for defining predicates or relations on domains, with applications ranging from reasoning principles for program equivalence to proofs of adequacy connecting…
We analyze identifiability as a possible explanation for the ubiquity of linear properties across language models, such as the vector difference between the representations of "easy" and "easiest" being parallel to that between "lucky" and…
An automaton is called reachable if every state is reachable from the initial state. This notion has been generalized coalgebraically in two ways: first, via a universal property on pointed coalgebras, namely, that a reachable coalgebra has…
Albiac and Wojtaszczyk introduced property (A) to characterize $1$-greedy bases. Later, Dilworth et al. generalized the concept to $C$-property (A), where the case $C = 1$ gives property (A). They (among other results) characterized greedy…
We show that every general theory \`a la Keisler with the Schr\"oder-Bernstein property is stable. This generalizes the corresponding result from classical logic due to John Goodrick. Our proof uses the classical result (generalized to the…
When faced with the question of how to represent properties in a formal proof system any user has to make design decisions. We have proved three of the theorems from Maskin's 2004 survey article on Auction Theory using the Isabelle/HOL…
We generalize Voronoi's theory of perfect quadratic forms to generalized copositive matrices over a closed convex and full-dimensional cone K. We introduce a notion of a K-copositive minimum and of perfect K-copositive matrices. We consider…
A Universal Mapping Property is generally described as a characterization of an object up to a unique isomorphism by considering its relation to every other object; however, the term "by considering its relation to every other object" is…
Property-based testing (PBT) is a technique for validating code against an executable specification by automatically generating test-data. We present a proof-theoretical reconstruction of this style of testing for relational specifications…
We introduce the Dichotomy Property, a new property of some languages in Set Computable Theory, in order to explore the expressivity of some languages which are extensions of MLS. By-product we prove undecidability of MLS extended with not…