Related papers: On the $abc$ and the $abcd$ conjectures
We investigate connections between SAT (the propositional satisfiability problem) and combinatorics, around the minimum degree (number of occurrences) of variables in various forms of redundancy-free boolean conjunctive normal forms…
The main result of [HL] (Annals of Math. 102 (1975), 223--290) gives a characterization of the boundaries of complex subvarieties in C^n. An application of this result concerning pseudoconvexity, namely Theorem 10.4 in [HL], is amplified.
In this paper we show that the compactness of a Loeb space depends on its cardinality, the nonstandard universe it belongs to and the underlying model of set theory we live in. In section 1 we prove that Loeb spaces are compact under…
We prove that the positive fragment of first-order intuitionistic logic in the language with two variables and a single monadic predicate letter, without constants and equality, is undecidable. This holds true regardless of whether we…
We consider entailment problems involving powerful constraint languages such as frontier-guarded existential rules in which we impose additional semantic restrictions on a set of distinguished relations. We consider restricting a relation…
Non-closedness of subexponentiality by the convolution operation is well-known. We go a step further and show that subexponentiality and non-subexponentiality are generally changeable by the convolution. We also give several conditions, by…
In many expert and everyday reasoning contexts it is very useful to reason on the basis of defeasible assumptions. For instance, if the information at hand is incomplete we often use plausible assumptions, or if the information is…
We present a conjecture on multiplicity of irreducible representations of a subgroup $H$ contained in the irreducible representations of a group $G$, with $G$ and $H$ having the same derived groups. We point out some consequences of the…
In the paper we propose a proof of Reeder's Conjecture on the graded multiplicities of small representations in the exterior algebra $\Lambda$g for the simple Lie algebras of type B and C.
We proved a truncated second main theorem of level one with explicit exceptional sets for analytic maps into $\mathbb P^2$ intersecting the coordinate lines with sufficiently high multiplicities. As applications, we studied some cases of…
We prove Vojta's abc conjecture for projective space ${\Bbb P}^n({\Bbb C})$, assuming that the entire curves in ${\Bbb P}^n({\Bbb C})$ are highly ramified over the coordinate hyperplanes. This extends the results of Guo Ji and the…
This paper describes a method used to construct infinitely many probable counterexamples of the abc conjecture over the rational integers.
We extend de Finetti's [Ann. Inst. H. Poincar\'{e} 7 (1937) 1--68] notion of exchangeability to finite and countable sequences of variables, when a subject's beliefs about them are modelled using coherent lower previsions rather than…
Discovery problems often require deciding whether additional sampling is needed to detect all categories whose prevalence exceeds a prespecified threshold. We study this question under a Bernoulli product (incidence) model, where categories…
We provide a lower bound on the probability that a binomial random variable is exceeding its mean. Our proof employs estimates on the mean absolute deviation and the tail conditional expectation of binomial random variables.
This note gives an elementary exposition of a variant of the spread polynomials in terms of Fibonacci and Lucas polynomials.
We consider the number of occurrences of subwords (non-consecutive sub-sequences) in a given word. We first define the notion of subword entropy of a given word that measures the maximal number of occurrences among all possible subwords. We…
We show that Vojta's conjecture for some rational surfaces is related to the $abc$ conjecture. More specifically, we prove that Vojta's conjecture on these surfaces implies a special case of the $abc$ conjecture, while the $abc$ conjecture…
In this paper we study the sets of integers which are $n$-th terms of Lucas sequences. We establish lower- and upper bounds for the size of these sets. These bounds are sharp for $n$ sufficiently large. We also develop bounds on the growth…
For every vector $\overline \alpha\in \RR^n$ and for every rational approximation $(\overline p,q)\in \RR^n\times\RR$ we can associate the displacement vector $q\alpha-\overline p$. We focus on algebraic vectors, namely $\overline…