bluuebunny/crossref_metadata_2025_split huggingface dataset:
Openness of Public Information at Regional Representative Institutions In Carrying out the Function of the Regional House of Representatives
Authors: Hikmat Mahi M 
Published: January 2020

Law No. 14 of 2008 on public information transparency (KIP), must implement the information transparency. One of the Government Public Councils whose accessibility of information transparency to public is Regional House of Representatives (DPRD). DPRD has two different functional structures, consisting of leadership with DPRD complementary organs and secretariat. DPRD should have strategy in the implementation of KIP and it was in the study entitled The Policy Implementation of Regional House of Representatives in Public Information Transparency. Inductive data analysis was conducted through of the data simplification processes into a more readable and interpretable form. This study employed the statutory approach and descriptive qualitative method to reveal the strategies applied by DPRD in implementing KIP. This normative legal research took data from regulation of law relating to KIP. The result of the study shows that the law of KIP provides an obligation to DPRD as an "object" or a "subject". DPRD is “Dual of Public Council", leadership—complementary organs of DPRD and secretariat who are authorized to determine the status of information. The strategies implemented by DPRD consisting of strengthening the implementation of KIP, asserting the differentiation of DPRD and secretariat position, and supporting KIP with the main function of DPRD.
Mutu Organoleptik Abon Ikan Roa Asap Dari Desa Bahoi Kecamatan Likupang Barat Kabupaten Minahasa Utara
Authors: Lohoo Helen Jenny , Palenewen Joyce C. V. 
Published: January 2020

Pemanfaatan ikan roa asap menjadi produk masih sangat terbatas, maka dari itu perlu dilakukan diversifikasi ikan roa asap dengan salah satu cara pengolahan produk abon. Pengolahan ikan roa asap menjadi abon akan memberi kepraktisan pada konsumen dalam mengkonsumsi ikan roa siap saji. Produk ini mempunyai tekstur yang lembut rasa dan aroma yang khas. Pembuatan abon merupakan salah satu alternatif pengolahan ikan. Hal ini dilakukan untuk mengantisipasi kelimpahan produksi ataupun untuk penganekaragaman produk perikanan. Pada kegiatan ini ikan yang dibuat abon adalah ikan roa asap yang diberi perlakuan diperas menggunakan spinner dan tanpa menggunakan mesin spinner, sedangkan panelis adalah ibu ibu yang mengolah abon ikan roa asap dan beberapa ibu lainnya yang ada di desa Bahoi. Hasil uji organoleptik dan mutu abon ikan roa asap yang diproduksi oleh perempuan (ibu-ibu pesisir) desa Bahoi Kecamatan Likupang Barat Kabupaten Minahasa Utara Provinsi Sulawesi Utara memperlihatkan bahwa panelis memberikan respon rata-rata sangat suka dan amat sangat suka (nilai 8 dan 9) terhadap rasa, aroma dan tekstur produk abon ikan roa asap yang dilakukan penirisan minyak menggunakan mesin spinner. Untuk pengujian lainnnya seperti Kadar air, dan Total Plate Count memberikan hasil memenuhi standar nasional Indonesia (SNI) untuk produk abon pada umumnya.
АНАЛІЗ ЗАСОБІВ БЕЗПЕКИ БІОМЕТРИЧНОЇ ІНФОРМАЦІЇ
Authors: Полетаєв Олексій , Матвєєв Дмитро 
Published: January 2020

Використання біометричної інформації в цифровому світі вимагає надійність і безпечність під час оперування. У даній статі приводяться приклади біометричної інформації, яку можна зчитувати та використовувати для збереження особистої інформації. Також проаналізували плюси і мінуси кожного із способів і виявили кращий спосіб.
ГЕНЕЗИС ЗАКОНОДАВСТВА УКРАЇНИ ЩОДО ПРАВ ТА ОБОВ’ЯЗКІВ БАТЬКІВ З ВИХОВАННЯ ДИТИНИ
Authors: Резвова Ольга 
Published: January 2020

На сучасному етапі розвитку суспільства, надзвичайної актуальності набуває проблема правового регулювання відносин, що виникають у сфері реалізації й захисту прав та обов’язків батьків щодо виховання дитини в сімейному законодавстві України. В цілому огляд даної статті показує, що проблеми реалізації та захисту прав та обов’язків батьків щодо виховання дитини не піддавалися системному аналізу та комплексному науковому вивченню. Вищезазначене засвідчує актуальність теоретичного аналізу правової оцінки різних видів суспільних правовідносин у вказаній сфері, визначає коло питань, передбачених до розгляду, а також пріоритетні напрямки дослідження. Останніми роками правовому статусу дитини, зокрема її правам, на законодавчому рівні приділяється велика увага. Про це може свідчити навіть факт імплементації низки міжнародно-правових актів у національне законодавство України. На рівні міжнародно-правових актів шляхом покладення обов’язків на держав-учасниць конвенцій передбачається якісна охорона та захист прав дитини. В даній статті проаналізовано як генезис законодавства України щодо прав та обов’язків батьків з виховання дитини так і виявлено ключові проблеми формування та реалізації державної політики в цій сфері. Також досліджено обставини, які нівелюють гарантоване право дитини на належне утримання, забезпечення її майнових інтересів належним чином та способом, так і права, свободи та обов’язки батьками дитини виховувати її. Оскільки діти є однією з визначальних концепцій, що лежать в основі як міжнародних так і національних правових актів, становить фундамент правового статусу дитини, є вихідним положенням у правовому регулюванні відносин у сім'ї, навчальних закладах та інших відносин, одним із учасників яких є дитина. Відсутність законодавчого закріплення визначення людської гідності дитини ускладнює процес реалізації прав та свобод дитини, сприяє використанню прав батьків, опікунів тощо всупереч їх цільового призначення.
Analisis Pemanfaatan harta dalam Konsumsi Masyarakat Ekonomi Konvensional dan Ekonomi Islam
Authors: Samsul Samsul 
Published: January 2020

Artikel yang berjudul “Analisis Pemanfaatan Harta dalam Konsumsi Masyarakat (Studi Komparatif Ekomomi Konvensional dan Ekonomi Islam” merupakan metode analisis data deskriptif kualitatif. Metode kualitatif ini digunakan untuk mencari jawaban rumusan masalah bagaimana pemanfaatan harta dalam konsumsi masyarakat perspektif ekonomi konvensional dan ekonomi Islam dan bagaimana konsep konsumsi masyarakat ekonomi konvensional dan ekonomi Islam. Teknik pengumpulan data dari penelitian ini menggunakan studi pustaka yaitu mengumpulkan dan memeriksa atau menelusuri dokumen-dokumen atau kepustakaan seperti buku- buku, skripsi, kamus dan lain sebagainya yang menjadi sumber data primer, skunder, tersier yang dapat memberikan informasi yang dibutuhkan peneliti dan menggunakan pendekatan sosiologis, suatu landasan kajian sebuah studi atau penelitian untuk mempelajari hidup bersama dalam masyarakat. Hasil penelitian ini menunjukkan bahwa pemanfaatan harta terbagi atas dua yaitu pengembangan harta dan penggunaan harta. Penggunaan harta merupakan alat dan sarana untuk melakukan aktivitas konsumsi untuk memenuhi kebutuhan jasmani dan rohani konsumen. Penggunaan harta dalam aktivitas konsumsi ekonomi konvensional merupakan kebebasan untuk mencapai kepuasan sedangkan dalam ekonomi Islam belanja untuk keperluan yang sifatnya konsumtif ini tetap diatur oleh hukum syari’at sehingga ada yang dibolehkan syari’at ada juga belanja yang diharamkan oleh syari’at. Ekonomi konvensional kebutuhan ditentukan oleh konsep kepuasan (utility) sedangkan dalam ekonomi Islam kebutuhan ditentukan oleh konsep mashlahah yang bertujuan untuk mencapai falah (kejayaan di dunia dan di akhirat) sedangkan dalam ekonomi konvensional kepuasan hanya diperuntukan untuk dunia.
Refined Inversion Statistics on Permutations
Authors: Sack Joshua , Úlfarsson Henning 
Published: January 2020

We introduce and study new refinements of inversion statistics for permutations, such as $k$-step inversions, (the number of inversions with fixed position differences) and non-inversion sums (the sum of the differences of positions of the non-inversions of a permutation). We also provide a distribution function for non-inversion sums, a distribution function for $k$-step inversions that relates to the Eulerian polynomials, and special cases of distribution functions for other statistics we introduce, such as $(\le\!\!k)$-step inversions and $(k_1,k_2)$-step inversions (that fix the value separation as well as the position). We connect our refinements to other work, such as inversion tops that are $0$ modulo a fixed integer $d$, left boundary sums of paths, and marked meshed patterns. Finally, we use non-inversion sums to show that for every number $n>34$, there is a permutation such that the dot product of that permutation and the identity permutation (of the same length) is $n$.
On the Parity of Certain Coefficients for a $q$-Analogue of the Catalan Numbers
Authors: Killpatrick Kendra 
Published: January 2020

The 2-adic valuation (highest power of 2) dividing the well-known Catalan numbers, $C_n$, has been completely determined by Alter and Kubota and further studied combinatorially by Deutsch and Sagan. In particular, it is well known that $C_n$ is odd if and only if $n = 2^k-1$ for some $k \geq 0$. The polynomial $F_n^{ch}(321;q) = \sum_{\sigma \in Av_n(321)} q^{ch(\sigma)}$, where $Av_n(321)$ is the set of permutations in $S_n$ that avoid 321 and $ch$ is the charge statistic, is a $q$-analogue of the Catalan numbers since specializing $q=1$ gives $C_n$. We prove that the coefficient of $q^i$ in $F_{2^k-1}^{ch}(321;q)$ is even if $i \geq 1$, giving a refinement of the "if" direction of the $C_n$ parity result. Furthermore, we use a bijection between the charge statistic and the major index to prove a conjecture of Dokos, Dwyer, Johnson, Sagan and Selsor regarding powers of 2 and the major index. In addition, Sagan and Savage have recently defined a notion of $st$-Wilf equivalence for any permutation statistic $st$ and any two sets of permutations $\Pi$ and $\Pi'$. We say $\Pi$ and $\Pi'$ are $st$-Wilf equivalent if $\sum_{\sigma \in Av_n(\Pi)} q^{st(\sigma)} = \sum_{\sigma \in Av_n(\Pi')} q^{st(\sigma)}$. In this paper we show how one can characterize the charge-Wilf equivalence classes for subsets of $S_3$.
On 021-Avoiding Ascent Sequences
Authors: Chen William Y.C. , Dai Alvin Y.L. , Dokos Theodore , Dwyer Tim , Sagan Bruce E. 
Published: January 2020

Ascent sequences were introduced by Bousquet-Mélou, Claesson, Dukes and Kitaev in their study of $(\bf{2+2})$-free posets. An ascent sequence of length $n$ is a nonnegative integer sequence $x=x_{1}x_{2}\ldots x_{n}$ such that $x_{1}=0$ and $x_{i}\leq {\rm asc}(x_{1}x_{2}\ldots x_{i-1})+1$ for all $1<i\leq n$, where ${\rm asc}(x_{1}x_{2}\ldots x_{i-1})$ is the number of ascents in the sequence $x_{1}x_{2}\ldots x_{i-1}$. We let $\mathcal{A}_n$ stand for the set of such sequences and use $\mathcal{A}_n(p)$ for the subset of sequences avoiding a pattern $p$. Similarly, we let $S_{n}(\tau)$ be the set of $\tau$-avoiding permutations in the symmetric group $S_{n}$. Duncan and Steingrímsson have shown that the ascent statistic has the same distribution over $\mathcal{A}_n(021)$ as over $S_n(132)$. Furthermore, they conjectured that the pair $({\rm asc}, {\rm rmin})$ is equidistributed over $\mathcal{A}_n(021)$ and $S_n(132)$ where ${\rm rmin}$ is the right-to-left minima statistic. We prove this conjecture by constructing a bistatistic-preserving bijection.
Counting Packings of Generic Subsets in Finite Groups
Authors: Bacher Roland 
Published: January 2020

A packing of subsets $\mathcal S_1,\dots,\mathcal S_n$ in a group $G$ is an element $(g_1,\dots,g_n)$ of $G^n$ such that $g_1\mathcal S_1,\dots,g_n\mathcal S_n$ are disjoint subsets of $G$. We give a formula for the number of packings if the group $G$ is finite and if the subsets $\mathcal S_1,\dots,\mathcal S_n$ satisfy a genericity condition. This formula can be seen as a generalization of the falling factorials which encode the number of packings in the case where all the sets $\mathcal S_i$ are singletons.
A Note on Total and Paired Domination of Cartesian Product Graphs
Authors: Choudhary K. , Margulies S. , Hicks I. V. 
Published: January 2020

A dominating set $D$ for a graph $G$ is a subset of $V(G)$ such that any vertex not in $D$ has at least one neighbor in $D$. The domination number $\gamma(G)$ is the size of a minimum dominating set in G. Vizing's conjecture from 1968 states that for the Cartesian product of graphs $G$ and $H$, $\gamma(G)\gamma(H) \leq \gamma(G \Box H)$, and Clark and Suen (2000) proved that $\gamma(G)\gamma(H) \leq 2 \gamma(G \Box H)$. In this paper, we modify the approach of Clark and Suen to prove a variety of similar bounds related to total and paired domination, and also extend these bounds to the $n$-Cartesian product of graphs $A^1$ through $A^n$.
Ramsey Numbers $R(K_3, G)$ for Graphs of Order 10
Authors: Brinkmann Gunnar , Goedgebeur Jan , Schlage-Puchta Jan-Christoph 
Published: January 2020

In this article we give the generalized triangle Ramsey numbers $R(K_3, G)$ of 12 005 158 of the 12 005 168 graphs of order 10. There are 10 graphs remaining for which we could not determine the Ramsey number. Most likely these graphs need approaches focusing on each individual graph in order to determine their triangle Ramsey number. The results were obtained by combining new computational and theoretical results. We also describe an optimized algorithm for the generation of all maximal triangle-free graphs and triangle Ramsey graphs. All Ramsey numbers up to 30 were computed by our implementation of this algorithm. We also prove some theoretical results that are applied to determine several triangle Ramsey numbers larger than 30. As not only the number of graphs is increasing very fast, but also the difficulty to determine Ramsey numbers, we consider it very likely that the table of all triangle Ramsey numbers for graphs of order 10 is the last complete table that can possibly be determined for a very long time.
Self-Avoiding Walks and the Fisher Transformation
Authors: Grimmett Geoffrey , Li Zhongyang 
Published: January 2020

The Fisher transformation acts on cubic graphs by replacing each vertex by a triangle. We explore the action of the Fisher transformation on the set of self-avoiding walks of a cubic graph. Iteration of the transformation yields a sequence of graphs with common critical exponents, and with connective constants converging geometrically to the golden mean. We consider the application of the Fisher transformation to one of the two classes of vertices of a bipartite cubic graph. The connective constant of the ensuing graph may be expressed in terms of that of the initial graph. When applied to the hexagonal lattice, this identifies a further lattice whose connective constant may be computed rigorously.
A Proof of Erdős-Fishburn's Conjecture for $g(6)=13$
Authors: Xianglin Wei 
Published: January 2020

A planar point set $X$ in the Euclidean plane is called a $k$-distance set if there are exactly $k$ distances between two distinct points in $X$. An interesting problem is to find the largest possible cardinality of a $k$-distance set. This problem was introduced by Erdős and Fishburn (1996). Maximum planar sets that determine $k$ distances for $k$ less than 5 have been identiﬁed. The 6-distance conjecture of Erdős and Fishburn states that 13 is the maximum number of points in the plane that determine exactly 6 different distances. In this paper, we prove the conjecture.
Kauffman's Clock Lattice as a Graph of Perfect Matchings: a Formula for its Height
Authors: Cohen Moshe , Teicher Mina 
Published: January 2020

We give an algorithmic computation for the height of Kauffman's clock lattice obtained from a knot diagram with two adjacent regions starred and without crossing information specified. We show that this lattice is more familiarly the graph of perfect matchings of a bipartite graph obtained from the knot diagram by overlaying the two dual Tait graphs of the knot diagram. Furthermore we prove structural properties of the bipartite graph in general. This setting also makes evident applications to Chebyshev or harmonic knots, whose related bipartite graph is the popular grid graph, and to discrete Morse functions.
Regularity of Join-meet Ideals of Distributive Lattices
Authors: Ene Viviana , Qureshi Ayesha Asloob , Rauf Asia 
Published: January 2020

Let $L$ be a distributive lattice and $R(L)$ the associated Hibi ring. We compute reg $R(L)$ when $L$ is a planar lattice and give bounds for reg $R(L)$ when $L$ is non-planar, in terms of the combinatorial data of $L.$ As a consequence, we characterize the distributive lattices $L$ for which the associated Hibi ring has a linear resolution.
Spanning $k$-trees of Bipartite Graphs
Authors: Kano Mikio , Ozeki Kenta , Suzuki Kazuhiro , Tsugaki Masao , Yamashita Tomoki 
Published: January 2020

A tree is called a $k$-tree if its maximum degree is at most $k$. We prove the following theorem. Let $k \geq 2$ be an integer, and $G$ be a connected bipartite graph with bipartition $(A,B)$ such that $|A| \le |B| \le (k-1)|A|+1$. If $\sigma_k(G) \ge |B|$, then $G$ has a spanning $k$-tree, where $\sigma_k(G)$ denotes the minimum degree sum of $k$ independent vertices of $G$. Moreover, the condition on $\sigma_k(G)$ is sharp. It was shown by Win (Abh. Math. Sem. Univ. Hamburg, 43, 263–267, 1975) that if a connected graph $H$ satisfies $\sigma_k(H) \ge |H|-1$, then $H$ has a spanning $k$-tree. Thus our theorem shows that the condition becomes much weaker if the graph is bipartite.
A Characteristic Factor for the 3-Term IP Roth Theorem in $\mathbb{Z}_3^\mathbb{N}$
Authors: McCutcheon Randall , Windsor Alistair 
Published: January 2020

Let $\Omega = \bigoplus_{i=1}^\infty \mathbb{Z}_3$ and $e_i = (0, \dots, 0 , 1, 0, \dots)$ where the $1$ occurs in the $i$-th coordinate. Let $\mathscr{F}=\{ \alpha \subset \mathbb{N} : \varnothing \neq \alpha, \alpha \text{ is finite} \}$. There is a natural inclusion of $\mathscr{F}$ into $\Omega$ where $\alpha \in \mathscr{F}$ is mapped to $e_\alpha = \sum_{i \in \alpha} e_i$. We give a new proof that if $E \subset \Omega$ with $d^*(E) >0$ then there exist $\omega \in \Omega$ and $\alpha \in \mathscr{F}$ such that \[ \{ \omega, \omega+ e_\alpha, \omega + 2 e_\alpha \} \subset E.\]Our proof establishes that for the ergodic reformulation of the problem there is a characteristic factor that is a one step compact extension of the Kronecker factor.
Schur-Positivity in a Square
Authors: Ballantine Cristina , Orellana Rosa 
Published: January 2020

Determining if a symmetric function is Schur-positive is a prevalent and, in general, a notoriously difficult problem. In this paper we study the Schur-positivity of a family of symmetric functions. Given a partition $\nu$, we denote by $\nu^c$ its complement in a square partition $(m^m)$. We conjecture a Schur-positivity criterion for symmetric functions of the form $s_{\mu'}s_{\mu^c}-s_{\nu'}s_{\nu^c}$, where $\nu$ is a partition of weight $|\mu|-1$ contained in $\mu$ and the complement of $\mu$ is taken in the same square partition as the complement of $\nu$. We prove the conjecture in many cases.
$k$-Fold Sidon Sets
Authors: Cilleruelo Javier , Timmons Craig 
Published: January 2020

Let $k \geq 1$ be an integer. A set $A \subset \mathbb{Z}$ is a $k$-fold Sidon set if $A$ has only trivial solutions to each equation of the form $c_1 x_1 + c_2 x_2 + c_3 x_3 + c_4 x_4 = 0$ where $0 \leq |c_i | \leq k$, and $c_1 + c_2 + c_3 + c_4 = 0$. We prove that for any integer $k \geq 1$, a $k$-fold Sidon set $A \subset [N]$ has at most $(N/k)^{1/2} + O((Nk)^{1/4})$ elements. Indeed we prove that given any $k$ positive integers $c_1<\cdots <c_k$, any set $A\subset [N]$ that contains only trivial solutions to $c_i(x_1-x_2)=c_j(x_3-x_4)$ for each $1 \le i \le j \le k$, has at most $(N/k)^{1/2}+O((c_k^2N/k)^{1/4})$ elements. On the other hand, for any $k \geq 2$ we can exhibit $k$ positive integers $c_1,\dots, c_k$ and a set $A\subset [N]$ with $|A|\ge (\frac 1k+o(1))N^{1/2}$, such that $A$ has only trivial solutions to $c_i(x_1 - x_2) = c_j (x_3 - x_4)$ for each $1 \le i \le j\le k$.
More on the Wilson $W_{tk}(v)$ Matrices
Authors: Ahmadi M.H. , Akhlaghinia N. , Khosrovshahi G.B. , Maysoori Ch. 
Published: January 2020

For integers $0\leq t\leq k\leq v-t$, let $X$ be a $v$-set, and let $W_{tk}(v)$ be a ${v \choose t}\times{v \choose k}$ inclusion matrix where rows and columns are indexed by $t$-subsets and $k$-subsets of $X$, respectively, and for row $T$ and column $K$, $W_{tk}(v)(T,K)=1$ if $T\subseteq K$ and zero otherwise. Since $W_{tk}(v)$ is a full rank matrix, by reordering the columns of $W_{tk}(v)$ we can write $W_{tk}(v) = (S|N)$, where $N$ denotes a set of independent columns of $W_{tk}(v)$. In this paper, first by classifying $t$-subsets and $k$-subsets, we present a new decomposition of $W_{tk}(v)$. Then by employing this decomposition, the Leibniz Triangle, and a known right inverse of $W_{tk}(v)$, we construct the inverse of $N$ and consequently special basis for the null space (known as the standard basis) of $W_{tk}(v)$.
A Note on Independent Sets in Graphs with Large Minimum Degree and Small Cliques
Authors: Lyle Jeremy 
Published: January 2020

Graphs with large minimum degree containing no copy of a clique on $r$ vertices ($K_r$) must contain relatively large independent sets. A classical result of Andrásfai, Erdős, and Sós implies that $K_r$-free graphs $G$ with degree larger than $((3r-7)/(3r-4))|V(G)|$ must be $(r-1)$-partite. An obvious consequence of this result is that the same degree threshold implies an independent set of order $(1/(r-1))|V(G)|$. The following paper provides improved bounds on the minimum degree which would imply the same conclusion. This problem was first considered by Brandt, and we provide improvements over these initial results for $r > 5$.
Characteristic Points of Recursive Systems
Authors: Bell Jason P. , Burris Stanley N. , Yeats Karen A. 
Published: January 2020

Characteristic points have been a primary tool in the study of a generating function defined by a single recursive equation. We investigate the proper way to adapt this tool when working with multi-equation recursive systems.	Given an irreducible non-negative power series system with $m$ equations, let $\rho$ be the radius of convergence of the solution power series and let $\pmb{\tau}$ be the values of the solution series evaluated at $\rho$. The main results of the paper include: (a) the set of characteristic points form an antichain in ${\mathbb R}^{m+1}$, (b) given a characteristic point $(a,\mathbf{b})$, (i) the spectral radius of the Jacobian of $\pmb \gamma$ at $(a, \mathbf{b})$ is $\ge 1$, and (ii) it is $=1$ iff $(a,\mathbf{b}) = (\rho,\pmb{\tau})$, (c) if $(\rho,\pmb{\tau})$ is a characteristic point, then (i) $\rho$ is the largest $a$ for $(a,\mathbf{b})$ a characteristic point, and (ii) a characteristic point $(a,\mathbf{b})$ with $a=\rho$ is the extreme point $(\rho,\pmb{\tau})$.
Combinatorial Nullstellensatz Modulo Prime Powers and the Parity Argument
Authors: Varga László 
Published: January 2020

We present new generalizations of Olson's theorem and of a consequence of Alon's Combinatorial Nullstellensatz. These enable us to extend some of their combinatorial applications with conditions modulo primes to conditions modulo prime powers. We analyze computational search problems corresponding to these kinds of combinatorial questions and we prove that the problem of finding degree-constrained subgraphs modulo $2^d$ such as $2^d$-divisible subgraphs and the search problem corresponding to the Combinatorial Nullstellensatz over $\mathbb{F}_2$ belong to the complexity class Polynomial Parity Argument (PPA).