bluuebunny/crossref_metadata_2025_split huggingface dataset:
Celebrating the 150th anniversary of the Periodic Table: an outlook in the circular economy era
Authors: Musumarra Giuseppe 
Published: January 2020

The first version of The Periodic Table elaborated by Mendeleev was published on February 17th 1869. To celebrate the 150th anniversary of this event, the United Nations declared 2019 as the International Year of the Periodic Table. This discovery was achieved as the conclusion of a long itinerary engaging several researchers investigating the periodicity in the properties of the chemical elements. In this process the Sicilian chemist Stanislao Cannizzaro provided a significant contribution. The impact of the Periodic Table on the scientific progress, as well as on the improvement of mankind life conditions and welfare, has been enormous. However, the increasing recognition of the limted resources of our planet, nowadays requires a change of paradigm from linear to circular economy. In order to tackle such a complex problem, the data reported in the traditional Periodic Table need to be integrated by information regarding the elements availability in nature, the sustainability of the processes, and the recycling possibility. Examples regarding lithium, cobalt, and rare earth elements are reported.
HEGEMONI KIAI TERHADAP DEMOKRATISASI DI PESANTREN:
Authors: Madarik Muhammad , Hairul Puadi  
Published: January 2020

This research tries to uncover kiai's hegemony based on the perspective of language which is correlated with the discourse of democratic values. Gramsci's hegemony is used as the basis for analyzing word structures in the context of the territory of a pesantren caregiver, to dissect the level of kiai's intervention on the sustainability of democratization through his utterances. The context of power uses Foucault's assertion, that the pattern of power relations cannot be conceptualized as belonging to an individual or class. Therefore, the author tries to distill the level of democracy from the power relations of the kiai at pesantren Raudlatu Ulum 2 Putukrejo Gondanglegi Malang through the texture perspective of his expressions.
The method used is Qualitative research. This type of research uses methods of observation, interviews and documentation. In analyzing the data, the researcher uses the following steps: Field notes are reduced in categories. The results are presented for each category. Analysis of the language of caregivers in this paper is limited to two aspects: First, things that are nuanced politically. Second, matters relating to policies within the scope of pesantren.
PENGARUH PERILAKU INDIVIDU TERHADAP PELAKSANAAN KESEHATAN DAN KESELAMATAN KERJA DI PT. XXX INDONESIA
Authors: Wanta  , Rohendi  , Aji Tuhagana  
Published: January 2020

Penelitian dilakukan di PT. XXX Indonesia Jl. Maligi VIII Lot S-2 Kawasan Industri KIIC Desa Margakaya Kecamatan Telukjambe Barat Kabupaten Karawang Propinsi Jawa Barat. Penelitian ini bertujuan untuk mengetahui, menganalisis dan menjelaskan pengaruh perilaku individu terhadap keselamatan dan kesehatan kerja di PT. XXX Indonesia. Alat analisis yang digunakan uji validitas, uji reliabilitas, analisis korelasi, analisis regresi dan koefisien determinasi.

Hasil analisis koefisien korelasi antara perilaku individu dengan kesehatan dan keselamatan kerja diperoleh nilai sebesar 0,382 (r ≠ 0) dengan tingkat signifikansi sebesar 0,000, hal ini menunjukan bahwa terdapat hubungan positif rendah antara perilaku individu dengan kesehatan dan keselamatan kerja. Hasil analisis koefisien determinasi perilaku individu terhadap kesehatan dan keselamatan kerja diperoleh nilai sebesar 0,146 dengan tingkat signifikansi sebesar 0,000. Hal ini menunjukan bahwa terdapat pengaruh perilaku individu terhadap kesehatan dan keselamatan kerja sebesar 14,60% dan sisanya sebesar 85,40% dipengaruhi oleh factor lain yang tidak diteliti.

Kata kunci: Perilaku Individu, Kesehatan dan Keselamatan Kerja
The study was conducted at PT. XXX Indonesia Jl. Maligi VIII Lot S-2 KIIC Industrial Estate Margakaya Village, Telukjambe Barat District, Karawang Regency, West Java Province. This study aims to determine, analyze and explain the effect of individual behavior on occupational safety and health at PT. XXX Indonesia. The analytical tool used is validity test, reliability test, correlation analysis, regression analysis and coefficient of determination.

The results of the correlation coefficient analysis between individual behavior with occupational health and safety obtained a value of 0.382 (r ≠ 0) with a significance level of 0,000, this shows that there is a low positive relationship between individual behavior with health and safety. The results of the analysis of the coefficient of determination of individual behavior towards health and safety obtained a value of 0.146 with a significance level of 0.000. This shows that there is an influence of individual behavior on occupational health and safety by 14.60% and the remaining 85.40% is influenced by other factors not examined.
Keywords: individual behavior, occupational health and safety
PENYULUHAN PRINSIP-PRINSIP GOOD MANUFACTURING PRACTICES (GMP) PADA HOME INDUSTRY OLAHAN SINGKONG DAN UBI DI DESA TOKELAN, KECAMATAN PANJI, KABUPATEN SITUBONDO
Authors: Yekti Gema IA , Suryaningsih Yasmini 
Published: January 2020

Desa Tokelan merupakan salah satu desa yang ada di Kecamatan Panji yang memiliki beberapa home industry yang masih tradisional. Beberapa home industry yang masih tradisional yaitu home industry keripik singkong Jaya dan home industry Karang Mas Mbak Nur. Keduanya masih belum menerapkan prinsip-prinsip GMP dalam usahanya. Lingkungan produksi dari keduanya juga masih cenderung sederhana dengan memanfaatkan pekarangan rumah sebagai tempat produksi. Tata letak proses produksi pun tidak sesuai dengan prinsip GMP. Hal tersebut terjadi karena keterbatasan pengetahuan dan keterampilan mereka tentang prinsip GMP. Oleh sebab itu, penyuluhan tentang penerapan prinsip GMP perlu dilakukan untuk meningkatkan kualitas dan keamanan produk. Selain itu, prinsip GMP juga dapat menjamin kesehatan dan keselamatan pekerja. Penyuluhan penerapan prinsip GMP dilakukan dengan metode ceramah, diskusi, dan pendampingan. Materi yang akan disampaikan meliputi konsep keamanan pangan, bahaya-bahaya yang terkait produksi pangan olahan, prinsip-prinsip GMP, serta penerapan prinsip GMP.
Kata kunci: keamanan pangan, GMP, prinsip-prinsip GMP
Analysis of Character Education Strengthening Program Management In SMP Muhammadiyah 3 Depok
Authors: Basyir Azhar 
Published: January 2020

This studies describe the management of character education strengthening program (PPK) at SMP Muhammadiyah 3 Depok. The types of this research is descriptive-qualitative. the techniques of data collections using observation, interviews, and documentation. The results of this study are (1) The activities of PPK include flag ceremonies, 7S (senyum-smile, salam-peace in greetings, sapa-greetings, sopan-respectful, santun-courtesy, sigap-enthusiasm), (2) The management of the PPK program runs with a good formulation and has clear purpose. (3) Supporting factors for this program are adequate facilities and infrastructures, the presence of adequate and militant young teaching staff, principals who are classified as young and have a good work ethic.
The Smallest One-Realization of a Given Set
Authors: Zhao Ping , Diao Kefeng , Wang Kaishun 
Published: January 2020

For any set $S$ of positive integers, a mixed hypergraph ${\cal H}$ is a realization of $S$ if its feasible set is $S$, furthermore, ${\cal H}$ is a one-realization of $S$ if it is a realization of $S$ and each entry of its chromatic spectrum is either 0 or 1. Jiang et al. showed that the minimum number of vertices of a realization of $\{s,t\}$ with $2\leq s\leq t-2$ is $2t-s$. Král proved that there exists a one-realization of $S$ with at most $|S|+2\max{S}-\min{S}$ vertices. In this paper, we determine the number of vertices of the smallest one-realization of a given set. As a result, we partially solve an open problem proposed by Jiang et al. in 2002 and by Král in 2004.
Rainbow Hamilton Cycles in Uniform Hypergraphs
Authors: Dudek Andrzej , Frieze Alan , Ruciński Andrzej 
Published: January 2020

Let $K_n^{(k)}$ be the complete $k$-uniform hypergraph, $k\ge3$, and let $\ell$ be an integer such that $1\le \ell\le k-1$ and $k-\ell$ divides $n$. An $\ell$-overlapping Hamilton cycle in $K_n^{(k)}$ is a spanning subhypergraph $C$ of $K_n^{(k)}$ with $n/(k-\ell)$ edges and such that for some cyclic ordering of the vertices each edge of $C$ consists of $k$ consecutive vertices and every pair of adjacent edges in $C$ intersects in precisely $\ell$ vertices.We show that, for some constant $c=c(k,\ell)$ and sufficiently large $n$, for every coloring (partition) of the edges of $K_n^{(k)}$ which uses arbitrarily many colors but no color appears more than $cn^{k-\ell}$ times, there exists a rainbow $\ell$-overlapping Hamilton cycle $C$, that is every edge of $C$ receives a different color. We also prove that, for some constant $c'=c'(k,\ell)$ and sufficiently large $n$, for every coloring of the edges of $K_n^{(k)}$ in which the maximum degree of the subhypergraph induced by any single color is bounded by $c'n^{k-\ell}$, there exists a properly colored $\ell$-overlapping Hamilton cycle $C$, that is every two adjacent edges receive different colors. For $\ell=1$, both results are (trivially) best possible up to the constants. It is an open question if our results are also optimal for $2\le\ell\le k-1$.The proofs rely on a version of the Lovász Local Lemma and incorporate some ideas from Albert, Frieze, and Reed.
A Dice Rolling Game on a Set of Tori
Authors: Kang Jeehoon , Kim Suh-Ryung , Park Boram 
Published: January 2020

Some linear algebraic and combinatorial problems are widely studied in connection with $\sigma$-games. One particularissue is to characterize whether or not a given vector lies in the submodule generated by the rows of a given matrix over a commutative ring. In general, one can solve this problem easily and algorithmically using the linear algebra over commutative ring. However, if the matrix has some combinatorial structure, one may expect that some more can be asserted instead of merely giving an algorithm. A recent outstanding example appeared in this line of research is the paper by Florence and Meunier published in Journal of Algebraic Combinatorics in 2010. In the same spirit, we consider a matrix over $\mathbb{Z}_n$ to completely characterize the submodule generated by its rows and give a constructive proof. The main idea for the characterization is to find certain good basic elements in the row space and then express a given element as the linear combination of them as well as some additional term.
The Chromatic Index of a Graph Whose Core has Maximum Degree $2$
Authors: Kano Mikio , Akbari Saieed , Ghanbari Maryam , Nikmehr Mohammad Javad 
Published: January 2020

Let $G$ be a graph. The core of $G$, denoted by $G_{\Delta}$, is the subgraph of $G$ induced by the vertices of degree $\Delta(G)$, where $\Delta(G)$ denotes the maximum degree of $G$. A $k$-edge coloring of $G$ is a function $f:E(G)\rightarrow L$ such that $|L| = k$ and $f(e_1)\neq f(e_2)$ for all two adjacent edges $e_1$ and $e_2$ of $G$. The chromatic index of $G$, denoted by $\chi'(G)$, is the minimum number $k$ for which $G$ has a $k$-edge coloring. A graph $G$ is said to be Class $1$ if $\chi'(G) = \Delta(G)$ and Class $2$ if $\chi'(G) = \Delta(G) + 1$. In this paper it is shown that every connected graph $G$ of even order and with $\Delta(G_{\Delta})\leq 2$ is Class $1$ if $|G_{\Delta}|\leq 9$ or $G_{\Delta}$ is a cycle of order $10$.
Edge-Decomposition of Graphs into Copies of a Tree with Four Edges
Authors: Barát János , Gerbner Dániel 
Published: January 2020

We study edge-decompositions of highly connected graphs into copies of a given tree. In particular we attack the following conjecture by Barát and Thomassen: for each tree $T$, there exists a natural number $k_T$ such that if $G$ is a $k_T$-edge-connected graph, and $|E(T)|$ divides $|E(G)|$, then $E(G)$ has a decomposition into copies of $T$. As one of our main results it is sufficient to prove the conjecture for bipartite graphs. The same result has been independently obtained by Carsten Thomassen (2013).Let $Y$ be the unique tree with degree sequence $(1,1,1,2,3)$. We prove that if $G$ is a $191$-edge-connected graph of size divisible by $4$, then $G$ has a $Y$-decomposition. This is the first instance of such a theorem, in which the tree is different from a path or a star. Recently Carsten Thomassen proved a more general decomposition theorem for bistars, which yields the same result with a worse constant.
A Note on Zero-Sum 5-Flows in Regular Graphs
Authors: Akbari Saieed , Ghareghani Narges , Khosrovshahi Gholamreza , Zare Sanaz 
Published: January 2020

Let $G$ be a graph. A zero-sum flow of $G$ is an assignment of non-zero real numbers to the edges of $G$ such that the sum of the values of all edges incident with each vertex is zero. Let $k$ be a natural number. A zero-sum $k$-flow is a flow with values from the set $\{\pm 1,\ldots ,\pm(k-1)\}$. It has been conjectured that every $r$-regular graph, $r\geq 3$, admits a zero-sum $5$-flow. In this paper we provide an affirmative answer to this conjecture, except for $r=5$.
Three Color Ramsey Numbers for Graphs with at most 4 Vertices
Authors: Boza Luis , Dybizbański Janusz , Dzido Tomasz 
Published: January 2020

For given graphs $H_{1}, H_{2}, H_{3}$, the 3-color Ramsey number $R(H_{1},$ $H_{2}, H_{3})$ is the smallest integer $n$ such that if we arbitrarily color the edges of the complete graph of order $n$ with $3$ colors, then it always contains a monochromatic copy of $H_{i}$ colored with $i$, for some $1 \leq i \leq 3$.We study the bounds on 3-color Ramsey numbers $R(H_1,H_2,H_3)$, where $H_i$ is an isolate-free graph different from $K_2$ with at most four vertices, establishing that $R(P_4,C_4,K_4)=14$, $R(C_4,K_3,K_4-e)=17$, $R(C_4,K_3+e,K_4-e)=17$, $R(C_4,K_4-e,K_4-e)=19$, $28\le R(C_4,K_4-e,K_4)\le36$, $R(K_3,K_4-e,K_4)\le41$, $R(K_4-e,K_4-e,K_4)\le59$ and $R(K_4-e,K_4,K_4)\le113$. Also, we prove that $R(K_3+e,K_4-e,K_4-e)=R(K_3,K_4-e,K_4-e)$, $R(C_4,K_3+e,K_4)\le\max\{R(C_4,K_3,K_4),29\}\le32$, $R(K_3+e,K_4-e,K_4)\le\max\{R(K_3,K_4-e,K_4),33\}\le41$ and $R(K_3+e,K_4,K_4)\le\max\{R(K_3,K_4,K_4),2R(K_3,K_3,K_4)+2\}\le79$.This paper is an extension of the article by Arste, Klamroth, Mengersen [Utilitas Mathematica, 1996].
The Tight Upper Bound for the Number of Matchings of Tricyclic Graphs
Authors: Dolati Ardeshir , Golalizadeh Somayyeh 
Published: January 2020

In this paper, we determine the tight upper bound for the number of matchings of connected $n$-vertex tricyclic graphs. We show that this bound is $13 f_{n-4} + 16f_{n-5}$, where $f_n$ be the $n$th Fibonacci number. We also characterize the $n$-vertex simple connected tricyclic graph for which the bound is best possible.A corrigendum was added to this paper on Jun 17, 2015.
Forbidden Submatrices: Some New Bounds and Constructions
Authors: Anstee R.P. , Chen Ruiyuan 
Published: January 2020

We explore an extremal hypergraph problem for which both the vertices and edges are ordered. Given a hypergraph $F$ (not necessarily simple), we consider how many edges a simple hypergraph (no repeated edges) on $m$ vertices can have while forbidding $F$ as a subhypergraph where both hypergraphs have fixed vertex and edge orderings. A hypergraph of $n$ edges on $m$ vertices can be encoded as an $m\times n$ (0,1)-matrix. We say a matrix is simple if it is a (0,1)-matrix with no repeated columns. Given a (0,1)-matrix $F$, we define ${\hbox{fs}}(m,F)$ as the maximum, over all simple matrices $A$ which do not have $F$ as a submatrix, of the number of columns in $A$. The row and column order matter. It is known that if $F$ is $k\times \ell$ then ${\hbox{fs}}(m,F)$ is $O(m^{2k-1-\epsilon})$ where $\epsilon=(k-1)/(13\log_2 \ell)$. Anstee, Frankl, Füredi and Pach have conjectured that if $F$ is $k$-rowed, then ${\hbox{fs}}(m,F)$ is $O(m^k)$. We show ${\hbox{fs}}(m,F)$ is $O(m^2)$ for $F= \left[{1\,0\,1\,0\,1\atop 0\,1\,0\,1\,0}\cdots\right]$ and for $F= \left[{1\,0\,1\,0\,1\atop 1\,0\,1\,0\,1}\cdots\right]$. The proofs use a type of amortized analysis. We also give some constructions.
Covering n-Permutations with (n+1)-Permutations
Authors: Allison Taylor F , Godbole Anant P , Hawley Kathryn M , Kay Bill 
Published: January 2020

Let $S_n$ be the set of all permutations on $[n]:=\{1,2,\ldots,n\}$. We denote by $\kappa_n$ the smallest cardinality of a subset ${\cal A}$ of $S_{n+1}$ that "covers" $S_n$, in the sense that each $\pi\in S_n$ may be found as an order-isomorphic subsequence of some $\pi'$ in ${\cal A}$. What are general upper bounds on $\kappa_n$? If we randomly select $\nu_n$ elements of $S_{n+1}$, when does the probability that they cover $S_n$ transition from 0 to 1? Can we provide a fine-magnification analysis that provides the "probability of coverage" when $\nu_n$ is around the level given by the phase transition? In this paper we answer these questions and raise others.
The Coin Exchange Problem and the Structure of Cube Tilings
Authors: Kisielewicz Andrzej Piotr , Przeslawski Krzysztof 
Published: January 2020

It is shown that if $[0,1)^d+t$, $t\in T$, is a unit cube tiling of $\mathbb{R}^d$, then for every $x\in T$, $y\in \mathbb{R}^d$, and every positive integer $m$ the number $|T\cap (x+\mathbb{Z}^d)\cap([0,m)^d+ y)|$ is divisible by $m$. Furthermore, by a result of Coppersmith and Steinberger on cyclotomic arrays it is proven that for every finite discrete box $D=D_1\times\cdots\times D_d \subseteq x+\mathbb{Z}^d$ of size $m_1\times \cdots\times m_d$ the number $|D\cap T|$ is a linear combination of $m_1,\ldots, m_d$ with non-negative integer coefficients. Several consequences are collected. A generalization is presented.
The Edit Distance Function and Symmetrization
Authors: Martin Ryan R. 
Published: January 2020

The edit distance between two graphs on the same labeled vertex set is the size of the symmetric difference of the edge sets. The distance between a graph, G, and a hereditary property, ℋ, is the minimum of the distance between G and each G'∈ℋ. The edit distance function of ℋ is a function of p∈[0,1] and is the limit of the maximum normalized distance between a graph of density p and ℋ.This paper utilizes a method due to Sidorenko [Combinatorica 13(1), pp. 109-120], called "symmetrization", for computing the edit distance function of various hereditary properties. For any graph H, Forb(H) denotes the property of not having an induced copy of H. This paper gives some results regarding estimation of the function for an arbitrary hereditary property. This paper also gives the edit distance function for Forb(H), where H is a cycle on 9 or fewer vertices.
The Closed Knight Tour Problem in Higher Dimensions
Authors: Erde Joshua , Golénia Bruno , Golénia Sylvain 
Published: January 2020

The problem of existence of closed knight tours for rectangular chessboards was solved by Schwenk in 1991. Last year, in 2011, DeMaio and Mathew provide an extension of this result for $3$-dimensional rectangular boards. In this article, we give the solution for $n$-dimensional rectangular boards, for $n\geq 4$.
Finding a Princess in a Palace: a Pursuit-Evasion Problem
Authors: Britnell John R , Wildon Mark 
Published: January 2020

This paper solves a pursuit-evasion problem in which a prince must find a princess who is constrained to move on each day from one vertex of a finite graph to another. Unlike the related and much studied `Cops and Robbers Game', the prince has no knowledge of the position of the princess; he may, however, visit any single room he wishes on each day. We characterize the graphs for which the prince has a winning strategy, and determine, for each such graph, the minimum number of days the prince requires to guarantee to find the princess.
Combinatorial Expansions in $K$-Theoretic Bases
Authors: Bandlow Jason , Morse Jennifer 
Published: January 2020

We study the class $\mathcal C$ of symmetric functions whose coefficients in the Schur basis can be described by generating functions for sets of tableaux with fixed shape. Included in this class are the Hall-Littlewood polynomials, $k$-Schur functions, and Stanley symmetric functions; functions whose Schur coefficients encode combinatorial, representation theoretic and geometric information. While Schur functions represent the cohomology of the Grassmannian variety of $GL_n$, Grothendieck functions $\{G_\lambda\}$ represent the $K$-theory of the same space. In this paper, we give a combinatorial description of the coefficients when any element of $\mathcal C$ is expanded in the $G$-basis or the basis dual to $\{G_\lambda\}$.
Properties of Random Difference Graphs
Authors: Ross Christopher 
Published: January 2020

Generate a bipartite graph on a partitioned set of vertices by randomly assigning to each vertex $v$ some weight $w(v) \in [0,1]$ and adding an edge between vertices $u$ and $v$ (in distinct parts) if and only if $w(v) + w(v) > 1$; the results of such processes are known as difference graphs.Random difference graphs of a given size can be produced either by uniformly random generation of weights or by choosing a graph uniformly at random from the set of all such graphs. We prove that these two methods give rise to the same distribution, and use this equivalence to find exact results for the likelihood of connectivity and Hamiltonicity. We also find the distribution of other properties, such as matching number and degeneracy.
A Plethysm Formula on the Characteristic Map of Induced Linear Characters from $U_n(\mathbb F_q)$ to $GL(\mathbb F_q)$
Authors: Chen Zhi 
Published: January 2020

This paper gives a plethysm formula on the characteristic map of the induced linear characters from the unipotent upper-triangular matrices $U_n(\mathbb F_q)$ to $GL_n(\mathbb F_q)$, the general linear group over finite field $\mathbb F_q$. The result turns out to be a multiple of a twisted version of the Hall-Littlewood symmetric functions $\tilde{P}_n[Y;q]$. A recurrence relation is also given which makes it easy to carry out the computation.
Repetition Threshold for Circular Words
Authors: Gorbunova Irina A. 
Published: January 2020

We find the threshold between avoidable and unavoidable repetitions in circular words over $k$ letters for any $k\ge6$. Namely, we show that the number $CRT(k)=\frac{\left\lceil {k/2}\right\rceil{+}1}{\left\lceil {k/2}\right\rceil}$ satisfies the following properties. For any $n$ there exists a $k$-ary circular word of length $n$ containing no repetition of exponent greater than $CRT(k)$. On the other hand, $k$-ary circular words of some lengths must have a repetition of exponent at least $CRT(k)$.
Classification of Cubic Symmetric Tricirculants
Authors: Kovacs Istvan , Kutnar Klavdija , Marusic Dragan , Wilson Steve 
Published: January 2020

A tricirculant is a graph admitting a non-identity automorphism having three cycles of equal length in its cycle decomposition. A graph is said to be symmetric if its automorphism group acts transitively on the set of its arcs. In this paper it is shown that the complete bipartite graph $K_{3,3}$, the Pappus graph, Tutte's 8-cage and the unique cubic symmetric graph of order 54 are the only connected cubic symmetric tricirculants.