Farm and Food Worker Inequity Exposed and Compounded by COVID-19

Of the 2.4 million farm-working laborers in the United States, upwards of 73% are immigrants. And, according to the Economic Policy Institute, immigrants make up nearly 22% of all workers in the U.S. food industry, including 27% of food production workers, 37% of meat processing industry workers, 34% of commercial bakery workers, and 31% of fruit and vegetable preservation work. Another study found that “[p]eople of color make up the majority of essential workers in food and agriculture (50%) and in industrial, commercial, residential facilities and services (53%).” Many of these workers--if not the majority in some sectors--are undocumented and/or unauthorized. Approximately 25% of U.S. immigrants were born in Mexico. Thus, when we discuss issues involving food and farm workers in the United States, we are largely talking about racial and ethnic minorities, undocumented individuals, and members of the immigrant community (foreign born and their children)

The PseudoDojo: Training and grading a 85 element optimized norm-conserving pseudopotential table

First-principles calculations in crystalline structures are often performed with a planewave basis set. To make the number of basis functions tractable two approximations are usually introduced: core electrons are frozen and the diverging Coulomb potential near the nucleus is replaced by a smoother expression. The norm-conserving pseudopotential was the first successful method to apply these approximations in a fully ab initio way. Later on, more efficient and more exact approaches were developed based on the ultrasoft and the projector augmented wave formalisms. These formalisms are however more complex and developing new features in these frameworks is usually more difficult than in the norm-conserving framework. Most of the existing tables of norm- conserving pseudopotentials, generated long ago, do not include the latest developments, are not systematically tested or are not designed primarily for high accuracy. In this paper, we present our PseudoDojo framework for developing and testing full tables of pseudopotentials, and demonstrate it with a new table generated with the ONCVPSP approach. The PseudoDojo is an open source project, building on the AbiPy package, for developing and systematically testing pseudopotentials. At present it contains 7 different batteries of tests executed with ABINIT, which are performed as a function of the energy cutoff. The results of these tests are then used to provide hints for the energy cutoff for actual production calculations. Our final set contains 141 pseudopotentials split into a standard and a stringent accuracy table. In total around 70.000 calculations were performed to test the pseudopotentials. The process of developing the final table led to new insights into the effects of both the core-valence partitioning and the non-linear core corrections on the stability, convergence, and transferability of norm-conserving pseudopotentials. ...Comment: abstract truncated, 17 pages, 25 figures, 8 table

Noncooperative algorithms in self-assembly

We show the first non-trivial positive algorithmic results (i.e. programs whose output is larger than their size), in a model of self-assembly that has so far resisted many attempts of formal analysis or programming: the planar non-cooperative variant of Winfree's abstract Tile Assembly Model. This model has been the center of several open problems and conjectures in the last fifteen years, and the first fully general results on its computational power were only proven recently (SODA 2014). These results, as well as ours, exemplify the intricate connections between computation and geometry that can occur in self-assembly. In this model, tiles can stick to an existing assembly as soon as one of their sides matches the existing assembly. This feature contrasts with the general cooperative model, where it can be required that tiles match on \emph{several} of their sides in order to bind. In order to describe our algorithms, we also introduce a generalization of regular expressions called Baggins expressions. Finally, we compare this model to other automata-theoretic models.Comment: A few bug fixes and typo correction

Trace anomaly of the conformal gauge field

The proposed by Bastianelli and van Nieuwenhuizen new method of calculations of trace anomalies is applied in the conformal gauge field case. The result is then reproduced by the heat equation method. An error in previous calculation is corrected. It is pointed out that the introducing gauge symmetries into a given system by a field-enlarging transformation can result in unexpected quantum effects even for trivial configurations.Comment: 9 pages, LaTeX file, BI-TP 93/3

Fixed-parameter tractability of multicut parameterized by the size of the cutset

Given an undirected graph $G$, a collection $\{(s_1,t_1),..., (s_k,t_k)\}$ of pairs of vertices, and an integer $p$, the Edge Multicut problem ask if there is a set $S$ of at most $p$ edges such that the removal of $S$ disconnects every $s_i$ from the corresponding $t_i$. Vertex Multicut is the analogous problem where $S$ is a set of at most $p$ vertices. Our main result is that both problems can be solved in time $2^{O(p^3)}... n^{O(1)}$, i.e., fixed-parameter tractable parameterized by the size $p$ of the cutset in the solution. By contrast, it is unlikely that an algorithm with running time of the form $f(p)... n^{O(1)}$ exists for the directed version of the problem, as we show it to be W[1]-hard parameterized by the size of the cutset

On the functions counting walks with small steps in the quarter plane

Models of spatially homogeneous walks in the quarter plane ${\bf Z}_+^{2}$ with steps taken from a subset $\mathcal{S}$ of the set of jumps to the eight nearest neighbors are considered. The generating function $(x,y,z)\mapsto Q(x,y;z)$ of the numbers $q(i,j;n)$ of such walks starting at the origin and ending at $(i,j) \in {\bf Z}_+^{2}$ after $n$ steps is studied. For all non-singular models of walks, the functions $x \mapsto Q(x,0;z)$ and $y\mapsto Q(0,y;z)$ are continued as multi-valued functions on ${\bf C}$ having infinitely many meromorphic branches, of which the set of poles is identified. The nature of these functions is derived from this result: namely, for all the 51 walks which admit a certain infinite group of birational transformations of ${\bf C}^2$, the interval $]0,1/|\mathcal{S}|[$ of variation of $z$ splits into two dense subsets such that the functions $x \mapsto Q(x,0;z)$ and $y\mapsto Q(0,y;z)$ are shown to be holonomic for any $z$ from the one of them and non-holonomic for any $z$ from the other. This entails the non-holonomy of $(x,y,z)\mapsto Q(x,y;z)$, and therefore proves a conjecture of Bousquet-M\'elou and Mishna.Comment: 40 pages, 17 figure

Asymptotic behaviour of convex and column-convex lattice polygons with fixed area and varying perimeter

We study the inflated phase of two dimensional lattice polygons, both convex and column-convex, with fixed area A and variable perimeter, when a weight \mu^t \exp[- Jb] is associated to a polygon with perimeter t and b bends. The mean perimeter is calculated as a function of the fugacity \mu and the bending rigidity J. In the limit \mu -> 0, the mean perimeter has the asymptotic behaviour \avg{t}/4 \sqrt{A} \simeq 1 - K(J)/(\ln \mu)^2 + O (\mu/ \ln \mu) . The constant K(J) is found to be the same for both types of polygons, suggesting that self-avoiding polygons should also exhibit the same asymptotic behaviour.Comment: 10 pages, 3 figure