The extremal ranks of subject to a pair of matrix equations
We discuss how to find the well-covered dimension of a graph that is the Cartesian product of paths, cycles, complete graphs, and other simple graphs. Also, a bound for the well-covered dimension of Kn × G is found, provided that G has a largest greedy independent decomposition of length c < n. Formulae to find the well-covered dimension of graphs obtained by vertex blowups on a known graph, and to the lexicographic product of two known graphs are also given.
A subset of the plane is called a two point set if it intersects any line in exactly two points. We give constructions of two point sets possessing some additional properties. Among these properties we consider: being a Hamel base, belonging to some -ideal, being (completely) nonmeasurable with respect to different -ideals, being a -covering. We also give examples of properties that are not satisfied by any two point set: being Luzin, Sierpiński and Bernstein set. We also consider natural generalizations...
We study two rather different problems, one arising from Diophantine geometry and one arising from Fourier analysis, which lead to very similar questions, namely to the study of the ranks of matrices with entries either zero or , where denotes the “centered” fractional part of . These ranks, in turn, are closely connected with the non-vanishing of the Dirichlet -functions at .