Common Independence in Graphs

The cardinality of a largest independent set of G, denoted by α(G), is called the independence number of G. The independent domination number i(G) of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concept of the common independence number of a graph G, denoted by αc(G), as the greatest integer r such that every vertex of G belongs to some independent subset X of VG with |X|≥r. The common independence number αc(G) of G is the limit of symmetry in G with respect to the fact that each vertex of G belongs to an independent set of cardinality αc(G) in G, and there are vertices in G that do not belong to any larger independent set in G. For any graph G, the relations between above parameters are given by the chain of inequalities i(G)≤αc(G)≤α(G). In this paper, we characterize the trees T for which i(T)=αc(T), and the block graphs G for which αc(G)=α(G).

Linear Independence of Logarithms of Cyclotomic Numbers and a Conjecture of Livingston

In 1965, A. Livingston conjectured the $\overline{\mathbb{Q}}$-linear independence of logarithms of values of the sine function at rational arguments. In 2016, S. Pathak disproved the conjecture. In this article, we give a new proof of Livingston’s conjecture using some fundamental trigonometric identities. Moreover, we show that a stronger version of her theorem is true. In fact, we modify this conjecture by introducing a co-primality condition, and in that case we provide the necessary and sufficient conditions for the conjecture to be true. Finally, we identify a maximal linearly independent subset of the numbers considered in Livingston’s conjecture.

Central elements of the Jennings basis and certain Morita invariants

From Morita theoretic viewpoint, computing Morita invariants is important. We prove that the intersection of the center and the [Formula: see text]th (right) socle [Formula: see text] of a finite-dimensional algebra [Formula: see text] is a Morita invariant; this is a generalization of important Morita invariants — the center [Formula: see text] and the Reynolds ideal [Formula: see text]. As an example, we also studied [Formula: see text] for the group algebra FG of a finite [Formula: see text]-group [Formula: see text] over a field [Formula: see text] of positive characteristic [Formula: see text]. Such an algebra has a basis along the socle filtration, known as the Jennings basis. We prove certain elements of the Jennings basis are central and hence form a linearly independent subset of [Formula: see text]. In fact, such elements form a basis of [Formula: see text] for every integer [Formula: see text] if [Formula: see text] is powerful. As a corollary we have [Formula: see text] if [Formula: see text] is powerful.

Searching for the causal effects of BMI in over 300 000 individuals, using Mendelian randomization

ABSTRACTMendelian randomization (MR) has been used to estimate the causal effect of body mass index (BMI) on particular traits thought to be affected by BMI. However, BMI may also be a modifiable, causal risk factor for outcomes where there is no prior reason to suggest that a causal effect exists. We perform a MR phenome-wide association study (MR-pheWAS) to search for the causal effects of BMI in UK Biobank (n=334 968), using the PHESANT open-source phenome scan tool. Of the 20 461 tests performed, our MR-pheWAS identified 519 associations below a stringent P value threshold corresponding to a 5% estimated false discovery rate, including many previously identified causal effects. We also identified several novel effects, including protective effects of higher BMI on a set of psychosocial traits, identified initially in our preliminary MR-pheWAS and replicated in an independent subset of UK Biobank. Such associations need replicating in an independent sample.

Strengthening $(a,b)$-Choosability Results to $(a,b)$-Paintability

Let $a,b\in\mathbb{N}$. A graph $G$ is $(a,b)$-choosable if for any list assignment $L$ such that $|L(v)|\ge a$, there exists a coloring in which each vertex $v$ receives a set $C(v)$ of $b$ colors such that $C(v)\subseteq L(v)$ and $C(u)\cap C(w)=\emptyset$ for any $uw\in E(G)$. In the online version of this problem, on each round, a set of vertices allowed to receive a particular color is marked, and the coloring algorithm chooses an independent subset of these vertices to receive that color. We say $G$ is $(a,b)$-paintable if when each vertex $v$ is allowed to be marked $a$ times, there is an algorithm to produce a coloring in which each vertex $v$ receives $b$ colors such that adjacent vertices receive disjoint sets of colors.We show that every odd cycle $C_{2k+1}$ is $(a,b)$-paintable exactly when it is $(a,b)$-chosable, which is when $a\ge2b+\lceil b/k\rceil$. In 2009, Zhu conjectured that if $G$ is $(a,1)$-paintable, then $G$ is $(am,m)$-paintable for any $m\in\mathbb{N}$. The following results make partial progress towards this conjecture. Strengthening results of Tuza and Voigt, and of Schauz, we prove for any $m \in \mathbb{N}$ that $G$ is $(5m,m)$-paintable when $G$ is planar. Strengthening work of Tuza and Voigt, and of Hladky, Kral, and Schauz, we prove that for any connected graph $G$ other than an odd cycle or complete graph and any $m\in\mathbb{N}$, $G$ is $(\Delta(G)m,m)$-paintable.

Out Subword-Free Languages and Its Subclasses

Let [Formula: see text] be a finite alphabet and [Formula: see text] the set of all words over [Formula: see text]. A subword-free language (also known as a hypercode) is an independent subset of [Formula: see text] with respect to the embedding order (denoted by [Formula: see text]) on [Formula: see text]. In this paper we introduce three subsets of the partial order [Formula: see text], and study three subclasses of languages defined by these subsets. They are out subword-free languages, left subword-free languages and right subword-free languages. The properties of these languages are established for determining their combinatorial and algebraic structures. By equipping them with two binary operations, respectively, all these classes of languages form semilattice-ordered semigroups. It is shown that they are freely generated by [Formula: see text] in three subvarieties of semilattice-ordered semigroups, respectively. It is also shown that the word problems for these free algebras are solvable.

A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets

Recently, Eisenbrand, Pach, Rothvoß, and Sopher studied the function $M(m, n)$, which is the largest cardinality of a convexly independent subset of the Minkowski sum of some planar point sets $P$ and $Q$ with $|P| = m$ and $|Q| = n$. They proved that $M(m,n)=O(m^{2/3}n^{2/3}+m+n)$, and asked whether a superlinear lower bound exists for $M(n,n)$. In this note, we show that their upper bound is the best possible apart from constant factors.