相关论文: A Non-commutative Monotone Selection Principle
Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…
We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…
Dempster's covariance selection method is extended first to general nonsingular matrices and then to full rank rectangular matrices. Dempster observed that his completion solved a maximum entropy problem. We show that our generalized…
This note is motivated by connections between the online and offline problems of selecting a possibly long subsequence from a Poisson-paced sequence of uniform marks under either a monotonicity or a sum constraint. The offline problem with…
When studying the multilinear PageRank problem, a system of polynomial equations needs to be solved. In this paper, we develop convergence theory for a modified Newton method in a particular parameter regime. The sequence of vectors…
In this paper we present a proof of Goodman's Theorem, a classical result in the metamathematics of constructivism, which states that the addition of the axiom of choice to Heyting arithmetic in finite types does not increase the collection…
Hindman's celebrated Finite Sums Theorem, and its high-dimensional version due to Milliken and Taylor, are extended from covers of countable sets to covers of arbitrary topological spaces with Menger's classic covering property. The methods…
By Easton's theorem one can force the exponential function on regular cardinals to take rather arbitrary cardinal values provided monotonicity and Koenig's lemma are respected. In models without choice we employ a "surjective" version of…
Let $F \subset S_k$ be a finite set of permutations and let $C_n(F)$ denote the number of permutations $\sigma$ in $S_n$ avoiding the set of patterns $F$. The Noonan-Zeilberger conjecture states that the sequence ${C_n(F)}$ is P-recursive.…
The point selection theorem says that the convex hull of any finite point set contains a point that lies in a positive proportion of the simplices determined by that set. This paper proves several new volumetric versions of this theorem…
We consider a variant of Dickson lemma, where each entry of a vector can be reseted or incremented by 1 in respect to the previous one. We give an example of non dominating sequence of length $2^{2^{\theta (n)}}$. It perfectly match the…
Top monotonicity is a relaxation of various well-known domain restrictions such as single-peaked and single-crossing for which negative impossibility results are circumvented and for which the median-voter theorem still holds. We examine…
We present new criteria on the existence of fixed points that combine some monotonicity assumptions with the classical fixed point index theory. As an illustrative application, we use our theoretical results to prove the existence of…
We see how nested sequents, a natural generalisation of hypersequents, allow us to develop a systematic proof theory for modal logics. As opposed to other prominent formalisms, such as the display calculus and labelled sequents, nested…
For the principal eigenvalue of discrete weighted $p$-Laplacian on the set of nonnegative integers, the convergence of an approximation procedure and the inverse iteration is proved. Meanwhile, in the proof of the convergence, the…
In this paper, we present monotone sequences of lower and upper bounds on the Perron value of a nonngeative matrix, and we study their strict monotonicity. Using those sequences, we provide two combinatorial applications. One is to improve…
In his Ph.D. thesis, Ira Gessel proved a reciprocity formula for noncommutative symmetric functions which enables one to count words and permutations with restrictions on the lengths of their increasing runs. We generalize Gessel's theorem…
We propose a low-complexity sign-dependent metric for sequence selection and study the nonlinear shaping gain achievable for a given computational cost, establishing a benchmark for future research. Small gains are obtained with feasible…
We present an improved incremental selection algorithm of the selection algorithm presented in [1] and prove all the selected conjectures.
The topic of this paper is the subtle interplay between countability and representations. In particular, we establish that the definition of countability of a certain set $X$ crucially hinges on the associated equivalence relation $=_{X}$.…