[Review of] Thompson III, J. Phillip. Double Trouble: Black Mayors, Black Communities, and the Call for a Deep Democracy

In Double Trouble, Thompson wrestles with the conflict of the viability of Black elected officials successfully leading major U.S. cities and remaining accountable to the Black poor. Thompson asserts the strategy of deep pluralism... how marginal groups are to achieve power in competitive struggles with other groups while still striving for a politics of common good. 1 The work provides a wealth of knowledge concerning inner city politics since the civil rights movement and deftly outlines the problems, such as white flight, federal dispersion of funds, and the depoliticizing of grassroots organizing, that have developed for Black mayors and working class communities. Double Trouble, however, raises essential questions which are never adequately addressed by the auth

Nonconvexity of the set of hypergraph degree sequences

It is well known that the set of possible degree sequences for a graph on $n$ vertices is the intersection of a lattice and a convex polytope. We show that the set of possible degree sequences for a $k$-uniform hypergraph on $n$ vertices is not the intersection of a lattice and a convex polytope for $k \geq 3$ and $n \geq k+13$. We also show an analogous nonconvexity result for the set of degree sequences of $k$-partite $k$-uniform hypergraphs and the generalized notion of $\lambda$-balanced $k$-uniform hypergraphs.Comment: 5 page

On the commutative quotient of Fomin-Kirillov algebras

The Fomin-Kirillov algebra $\mathcal E_n$ is a noncommutative algebra with a generator for each edge in the complete graph on $n$ vertices. For any graph $G$ on $n$ vertices, let $\mathcal E_G$ be the subalgebra of $\mathcal E_n$ generated by the edges in $G$. We show that the commutative quotient of $\mathcal E_G$ is isomorphic to the Orlik-Terao algebra of $G$. As a consequence, the Hilbert series of this quotient is given by $(-t)^n \chi_G(-t^{-1})$, where $\chi_G$ is the chromatic polynomial of $G$. We also give a reduction algorithm for the graded components of $\mathcal E_G$ that do not vanish in the commutative quotient and show that their structure is described by the combinatorics of noncrossing forests.Comment: 11 pages, 3 figure

HIERARCHY OF NEEDS IN DAN GILROY’S NIGHTCRAWLER

Nightcrawler is a crime-thriller movie directed by Dan Gilroy. The movie is about an ambitious videographer who sells violent footage of accidents and brutal crimes to the local news TV. The focus of this study is to analyse the motivation of Louis Bloom, the main character in the movie, using Abraham Maslow’s theory of needs. This theory is illustrated in a shape of five layered pyramid which represents every need that must be fulfilled by human. Those needs are physiological needs, safety needs, love or belongingness needs, esteem needs, and self-actualization needs. The result of the discussion shows the five phases of theory of needs reflected in Lou’s life