Related papers: Matrix iterations with vertical support restrictio…
Aitken extrapolation normally applied to convergent fixed point iteration is extended to extrapolate the solution of a divergent iteration. In addition, higher order Aitken extrapolation is introduced that enables successive decomposition…
Any model of ZFC + GCH has a generic extension (made with a poset of size aleph_2) in which the following hold: MA + 2^{aleph_0}= aleph_2+ there exists a Delta^2_1-well ordering of the reals. The proof consists in iterating posets designed…
Perfect paradefinite algebras are De Morgan algebras expanded with an operation that allows for the full behavior of classical negation to be restored. They form a variety that is term-equivalent to the variety of involutive Stone algebras.…
In 2003, Cohn and Umans proposed a group-theoretic approach to bounding the exponent of matrix multiplication. Previous work within this approach ruled out certain families of groups as a route to obtaining $\omega = 2$, while other…
I introduce a new family of axioms extending ZFC set theory, the $\Sigma_n$-correct forcing axioms. These assert roughly that whenever a forcing name $\dot{a}$ can be forced by a poset in some forcing class $\Gamma$ to have some $\Sigma_n$…
We prove that the generic maximal independent family obtained by iteratively forcing with the Mathias forcing relative to diagonalization filters is densely maximal. Moreover, by choosing the filters with some care one can ensure the family…
In this short note we give a new upper bound for the size of a set family with a single Hamming distance. Our proof is an application of the linear algebra bound method.
Following E. Wigner's original vision, we prove that sampling the eigenvalue gaps within the bulk spectrum of a fixed (deformed) Wigner matrix $H$ yields the celebrated Wigner-Dyson-Mehta universal statistics with high probability.…
In this paper, we introduce and study a new extragradient iterative process for finding a common element of the set of fixed points of an infinite family of nonexpansive mappings and the set of solutions of a variational inequality for an…
Inspired by the infinite families of finite and affine root systems, we consider a "stretching" operation on general crystallographic root systems which, on the level of Coxeter diagrams, replaces a vertex with a path of unlabeled edges. We…
Motivated by applications to perverse sheaves, we study combinatorics of two cell decompositions of the symmetric product of the complex line, refining the complex stratification by multiplicities. Contingency matrices, appearing in…
We develop a new method for building forcing iterations with symmetric systems of structures as side conditions. Using our method we prove that the forcing axiom for the class of all the small finitely proper posets is compatible with a…
In this paper, exact Hausdorff dimension formulas for a class of self-affine attractors generated by affine Iterated Function Systems are derived. We consider systems containing an affine map whose $n$-th iterate is a similarity…
In this paper we study set mappings on 4-tuples. We continue a previous work of Komjath and Shelah by getting new finite bounds on the size of free sets in a generic extension. This is obtained by an entirely different forcing construction.…
We consider the problem of determining the maximum number of pairs $F\subseteq F'$ in a family $\mathcal{F}\subseteq 2^{[n]}$ that avoids certain posets $P$ of height 2. We show that for any such $P$ the number of pairs is…
We enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our…
We prove some iteration theorems for a certain class of $\kappa^+$-cc forcing posets.
In this paper we report on new results relating to a conjecture regarding properties of $n\times n$, $n\leq 6$, positive definite matrices. The conjecture has been proven for $n\leq 4$ using computer-assisted sum of squares (SoS) methods…
Specht polynomials classically realize the irreducible representations of the symmetric group. The ideals defined by these polynomials provide a strong connection with the combinatorics of Young tableaux and have been intensively studied by…
We throw some light on the question: is there a MAD family (= a family of infinite subsets of N, the intersection of any two is finite) which is completely separable (i.e. any X subseteq N is included in a finite union of members of the…