Related papers: More on Cardinal Arithmetic

We study algebraic relations among postcritically finite (PCF) parameters in the family $f_c(z) = z^2 + c$. Ghioca, Krieger, Nguyen and Ye proved that an algebraic curve in $\mathbb{C}^2$ contains infinitely many PCF pairs $(c_1, c_2)$ if…

Boolean cardinality constraints state that at most (at least, or exactly) $k$ out of $n$ propositional literals can be true. We propose a new class of selection networks that can be used for an efficient encoding of them. Several comparator…

In Functional Analysis, certain conclusions apply to sequences, but they cannot be carried over when we consider nets. In fact, some nets, including sequences, can behave unexpectedly. In this paper we are interested in exploring the…

If kappa is strongly compact, lambda > kappa is regular, then (2^{< lambda})^+ --> (lambda+eta)^2_theta holds for eta,theta<kappa.

$\lambda$-quiddities of size $n$ are $n$-tuples of elements from a fixed set that are solutions to a matrix equation which is fundamental in the study of the combinatorics of the modular group and Coxeter's friezes. To gain further insight…

Let $\mathfrak{i}$ denote the minimal cardinality of a maximal independent family and let $\mathfrak{a}_T$ denote the minimal cardinality of a maximal family of pairwise almost disjoint subtrees of $2^{<\omega}$. Using a countable support…

In this paper we study the large linear and algebraic size of the family of unbounded continuous and integrable functions in $[0,+\infty)$ and of the family of sequences of these functions converging to zero uniformly on compacta and in…

We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…

For a regular uncountable cardinal kappa, we discuss the order relationship between the unbounding and dominating numbers on kappa and cardinal invariants of the higher meager ideal M_kappa. In particular, we obtain a complete…

We introduce a two-parameter modification of the cofinality invariant of ideals. This allows us to include the interaction of a pair of ideals in the study of base-like structures. We find the values (cardinal numbers or well-known cardinal…

The complexity of continuous piecewise affine (CPA) functions can be measured by the number of pieces $p$ or the number of distinct affine functions $n$. For CPA functions on $\mathbb{R}^d$, this paper shows an upper bound of $p=O(n^{d+1})$…

We study the $p$-adic variation of triangulations over $p$-adic families of $(\varphi,\Gamma)$-modules. In particular, we study certain canonical sub-filtrations of the pointwise triangulations and show that they extend to affinoid…

We present new results on finite satisfiability of logics with counting and arithmetic. One result is a tight bound on the complexity of satisfiability of logics with so-called local Presburger quantifiers, which sum over neighbors of a…

We introduce a notion of integration defined from filters over families of finite sets. This procedure corresponds to determining the average value of functions whose range lies in any algebraic structure in which finite averages make…

We investigate the class of models of a general dependent theory. We continue math.LO/0702292 in particular investigating so called "decomposition of types"; thesis is that what holds for stable theory and for Th(Q,<) hold for dependent…

We study an extension of the cardinality-constrained knapsack problem wherein each item has a concave piecewise linear utility structure (CCKP), which is motivated by applications such as resource management problems in monitoring and…

This paper has an expository nature. We compare the spectral properties (such as boundedness and compactness) of three families of semi-infinite matrices and point out similarities between them. The common feature of these families is that…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

We prove that assuming suitable cardinal arithmetic, if B is a Boolean algebra every homomorphic image of which is isomorphic to a factor, then B has locally small density. We also prove that for an (infinite) Boolean algebra B, the number…