bluuebunny/crossref_metadata_2025_split huggingface dataset:
Трансформация идеологических концепций в Османской империи в 1850–1900 гг. Османизм-панисламизм
Authors: Abidulin A.M. , Shirkina I.A. 
Published: January 2020

Аннотация Статья посвящена анализу идеологических концепций в Османской империи во второй половине XIX - начале XX века. Изучение генезиса терминов османизм и панисламизм позволяет нам отметить их западное происхождение и трактовать их в качестве идеологии сохранения империи и исламского единства, а также как стремление к культурному объединению всех мусульман, признающих духовную власть османского султана. В рамках изучаемого периода панисламизм рассматривается в тесной связи с предшествующей ему идеологической концепцией османизма. Показаны векторы, в которых панисламизм использовался как инструмент государственной политики в период правления султанаАбдул-Хамида II.Нами также исследуется процесс трансформации идеологических концепций позднего периода Османской империи. Показано, что концепции османизма и панисламизма соответствовали требованиям своего времени, учитывая политические и демографические обстоятельства, при этом не взаимозаменяя, а сосуществуя в тесной связи друг с другом.Abstract The article is devoted to the analysis of ideological concepts in the Ottoman Empire in the second half of the XIX early XX centuries. Studying the genesis of the terms Ottomanism and Pan-Islamism allows us to note their Western origin and treat them as an ideology of preserving the empire and Islamic unity, as well as a desire for the cultural unification of all Muslims who recognize the spiritual power of the Ottoman Sultan. Within the framework of the period under study, pan-Islamism is considered in close connection with the ideological concept of Ottomanism preceding it. The vectors in which pan-Islamism was used as an instrument of state policy during the reign of Sultan Abdul-Hamid II are shown. We also study the process of transformation of ideological concepts of the late period of the Ottoman Empire. It is shown that the concepts of Ottomanism and Pan-Islamism met the requirements of their time, given the political and demographic circumstances, while not interchangeably, but coexisting in close connection with each other.
Kult świętych a dobro państwa
Authors: Kowalska-Pietrzak Anna 
Published: January 2020

Patriotyzm narodził się w starożytności. Jego genezę wiąże się z kręgiem kultury antycznej, ale postawy patriotyczne występują także w Starym Testamencie. Uznaje się, że patriotyzm, w dzisiejszym rozumieniu, zaistniał dopiero w czasach formowania się narodów i państw narodowych. Jednak elity znały i rozumiały to pojęcie już wcześniej. Kronikarze używali pojęcia patria, w kontekście z którego wyraźnie wynikało, iż występuje ono jako kraj, z którym bohater opowieści jest złączony poczuciem miłości, troski o niego. B. Zientara uważał, iż do pogłębiania świadomości narodowej przyczyniał się zwłaszcza kult świętych państwowych, który trafiał do szerokich kręgów społecznych. Relikwie oraz przedmioty uznawane za własność świętych stawały się symbolami, skupiającymi kształtujące się uczucia religijne i narodowe. W ten sposób jedną z ról władców stawało się gromadzenie kolejnych relikwii, bo takie postępowanie mogło zapewnić państwu obfite łaski Boże.
Jak wynika z przeglądu źródeł i literatury przedmiotu, święci pełnili w okresie średniowiecza wiele kluczowych dla państwa ról. Ich relikwie były fundamentem ideowym wielu wspólnot politycznych, które współtworzyli. Ich wstawiennictwo u Boga i ich kult stawały się więc niemalże gwarancją budowania ładu i pomyślności państwa oraz jego mieszkańców. Kraj stawał się bezpieczniejszy, a w razie wojny mógł liczyć na wsparcie świętych patronów. W ten sposób kult świętych i modlitwę błagalną lub dziękczynną, zanoszoną za ich pośrednictwem do samego Boga, można uznać za jedną z form ówczesnego patriotyzmu.
Peran Pendayagunaan Dana Zakat Dalam Peningkatan Kualitas Pendidikan Oleh Lembaga Inisiatif Zakat Indonesia (IZI) cabang Sulawesi Selatan
Authors: Kappaja Ismail , Munir Ammar , Mokoginta Siska Kafka 
Published: January 2020

Artikel ini bertujuan untuk mengetahui pendayagunaan dana zakat dalam bidang pendidikan oleh lembaga Inisiatif Zakat Indonesia (IZI) cabang Sulawesi Selatan dan peran program pendayagunaan dana zakat dalam bidang pendidikan terhadap peningkatan kualitas pendidikan oleh lembaga Inisiatif Zakat Indonesia (IZI) cabang Sulawesi Selatan. Tulisan ini menggunakan metode kualitatif deskriptif. Jenis penelitian turun langsung ke lapangan kepada objek yang akan diteliti langsung. Penelitian lapangan atau penelitian kualitatif ini menitikberatkan pada hasil pengumpulan data dari informan yang ditentukan. Data yang dikumpulkan diolah melalui tiga tahap yaitu reduksi data, penyajian data dan penarikan simpulan. Hasil dari penelitian ini menunjukkan bahwa pendayagunaan dana zakat dalam bidang pendidikan oleh lembaga Inisiatif Zakat Indonesia (IZI) cabang Sulawesi Selatan terdiri dari dua bagian yaitu beasiswa mahasiswa dan beasiswa pelajar. Peran program pendayagunaan dana zakat dalam bidang pendidikan oleh lembaga Inisiatif Zakat Indonesia (IZI) cabang Sulawesi Selatan telah meningkatkan kualitas pendidikan penerima beasiswa. Peningkatan kualitas pendidikan pada bidang akademik.
Computational Results on the Traceability of Oriented Graphs of Small Order
Authors: Burger Alewyn 
Published: January 2020

A digraph $D$ is traceable if it contains a path visiting every vertex, and hypotraceable if $D$ is not traceable, but $D-v$ is traceable for every vertex $v\in V(D)$. Van Aardt, Frick, Katrenič and Nielsen [Discrete Math. 11(2011), 1273-1280] showed that there exists a hypotraceable oriented graph of order $n$ for every $n\geq 8$, except possibly for $n=9$ or $11$. These two outstanding existence questions for hypotraceable oriented graphs are settled in this paper --- the first in the negative and the second in the affirmative. Furthermore, $D$ is $k$-traceable if $D$ has at least $k$ vertices and each of its induced subdigraphs of order $k$ is traceable. It is known that for $k\leq 6$ every k-traceable oriented graph is traceable and that for $k=7$ and each $k\geq 9$ there exist nontraceable $k$-traceable oriented graphs of order $k+1$. The Traceability Conjecture states that for $k\geq 2$ every $k$-traceable oriented graph of order $n\geq 2k-1$ is traceable. In this paper it is shown via computer searches that all $7$-traceable and $8$-traceable oriented graphs of orders $9$, $10$ and $11$ are traceable, and that all $9$-traceable oriented graphs of order $11$ are traceable. All hypotraceable graphs of order $10$ are also found. Recently, these results are used to prove that the Traceability Conjecture also holds for $k =7, 8$ and 9, except possibly when $k=9$ and $22\leq n\leq 32$.
New Ramsey Classes from Old
Authors: Bodirsky Manuel 
Published: January 2020

Let $\mathcal{C}_1$ and $\mathcal{C}_2$ be strong amalgamation classes of finite structures, with disjoint finite signatures $\sigma$ and $\tau$. Then $\mathcal{C}_1 \wedge \mathcal{C}_2$ denotes the class of all finite ($\sigma\cup\tau$)-structures whose $\sigma$-reduct is from $\mathcal{C}_1$ and whose $\tau$-reduct is from $\mathcal{C}_2$. We prove that when $\mathcal{C}_1$ and $\mathcal{C}_2$ are Ramsey, then $\mathcal{C}_1 \wedge \mathcal{C}_2$ is also Ramsey. We also discuss variations of this statement, and give several examples of new Ramsey classes derived from those general results.
Triangle-Free Triangulations, Hyperplane Arrangements and Shifted Tableaux
Authors: Adin Ron , Roichman Yuval 
Published: January 2020

Flips of diagonals in colored triangle-free triangulations of a convex polygon are interpreted as moves between two adjacent chambers in a certain graphic hyperplane arrangement. Properties of geodesics in the associated flip graph are deduced. In particular, it is shown that: (1) every diagonal is flipped exactly once in a geodesic between a pair of distinguished antipodes; (2) the number of geodesics between these antipodes is equal to twice the number of standard Young tableaux of a truncated shifted staircase shape.
Large Incidence-free Sets in Geometries
Authors: De Winter Stefaan , Schillewaert Jeroen , Verstraete Jacques 
Published: January 2020

Let $\Pi = (P,L,I)$ denote a rank two geometry. In this paper, we are interested in the largest value of $|X||Y|$ where $X \subset P$ and $Y \subset L$ are sets such that $(X \times Y) \cap I = \emptyset$. Let $\alpha(\Pi)$ denote this value. We concentrate on the case where $P$ is the point set of $\mathsf{PG}(n,q)$ and $L$ is the set of $k$-spaces in $\mathsf{PG}(n,q)$. In the case that $\Pi$ is the projective plane $\mathsf{PG}(2,q)$, where $P$ is the set of points and $L$ is the set of lines of the projective plane, Haemers proved that maximal arcs in projective planes together with the set of lines not intersecting the maximal arc determine $\alpha(\mathsf{PG}(2,q))$ when $q$ is an even power of $2$. Therefore, in those cases,\[ \alpha(\Pi) = q(q - \sqrt{q} + 1)^2.\] We give both a short combinatorial proof and a linear algebraic proof of this result, and consider the analogous problem in generalized polygons. More generally, if $P$ is the point set of $\mathsf{PG}(n,q)$ and $L$ is the set of $k$-spaces in $\mathsf{PG}(n,q)$, where $1 \leq k \leq n - 1$, and $\Pi_q = (P,L,I)$, then we show as $q \rightarrow \infty$ that \[ \frac{1}{4}q^{(k + 2)(n - k)} \lesssim \alpha(\Pi) \lesssim q^{(k + 2)(n - k)}.\] The upper bounds are proved by combinatorial and spectral techniques. This leaves the open question as to the smallest possible value of $\alpha(\Pi)$ for each value of $k$. We prove that if for each $N \in \mathbb N$, $\Pi_N$ is a partial linear space with $N$ points and $N$ lines, then $\alpha(\Pi_N) \gtrsim \frac{1}{e}N^{3/2}$ as $N \rightarrow \infty$.
The Prime Stems of Rooted Circuits of Closure Spaces and Minimum Implicational Bases
Authors: Nakamura Masataka , Kashiwabara Kenji 
Published: January 2020

A rooted circuit is firstly introduced for convex geometries (antimatroids). We generalize it for closure systems or equivalently for closure operators. A rooted circuit is a specific type of a pair $(X,e)$ of a subset $X$, called a stem, and an element $e\not\in X$, called a root. We introduce a notion called a 'prime stem', which plays the key role in this article. Every prime stem is shown to be a pseudo-closed set of an implicational system. If the sizes of stems are all the same, the stems are all pseudo-closed sets, and they give rise to a canonical minimum implicational basis. For an affine convex geometry, the prime stems determine a canonical minimum basis, and furthermore gives rise to an optimal basis. A 'critical rooted circuit' is a special case of a rooted circuit defined for an antimatroid. As a precedence structure, 'critical rooted circuits' are necessary and sufficient to fix an antimatroid whereas critical rooted circuits are not necessarily sufficient to restore the original antimatroid as an implicational system. It is shown through an example.
Logarithmic Tree-Numbers for Acyclic Complexes
Authors: Kim Hyuk , Kook Woong 
Published: January 2020

For a $d$-dimensional cell complex $\Gamma$ with $\tilde{H}_{i}(\Gamma)=0$ for $-1\leq i < d$, an $i$-dimensional tree is a non-empty collection $B$ of $i$-dimensional cells in $\Gamma$ such that $\tilde{H}_{i}(B\cup \Gamma^{(i-1)})=0$ and $w(B):= |\tilde{H}_{i-1}(B\cup \Gamma^{(i-1)})|$ is finite, where $\Gamma^{(i)}$ is the $i$-skeleton of $\Gamma$. The $i$-th tree-number is defined $k_{i}:=\sum_{B}w(B)^{2}$, where the sum is over all $i$-dimensional trees. In this paper, we will show that if $\Gamma$ is acyclic and $k_{i}>0$ for $-1\leq i \leq d$, then $k_{i}$ and the combinatorial Laplace operators $\Delta_{i}$ are related by $\sum_{i=-1}^{d}\omega_{i}\,x^{i+1}=(1+x)^{2}\sum_{i=0}^{d-1}\kappa_{i} x^{i}$, where $\omega_{i}=\log \det \Delta_{i}$ and $\kappa_{i}=\log k_{i}$. We will discuss various consequences and applications of this equation.
On the Number of Orientations of Random Graphs with No Directed Cycles of a Given Length
Authors: Allen P. , Kohayakawa Y. , Mota G. O. , Parente R. F. 
Published: January 2020

Let $\vec H$ be an orientation of a graph $H$. Alon and Yuster proposed the problem of determining or estimating $D(n,m,\vec H)$, the maximum number of $\vec H$-free orientations a graph with $n$ vertices and $m$ edges may have. We consider the maximum number of $\vec H$-free orientations of typical graphs $G(n,m)$ with $n$ vertices and $m$ edges. Suppose $\vec H =C^\circlearrowright_\ell $ is the directed cycle of length $\ell\geq 3$. We show that if ${m\gg n^{1+1/(\ell-1)}}$, then this maximum is $2^{o(m)}$, while if ${m\ll n^{1+1/(\ell-1)}}$, then it is $2^{(1-o(1))m}$.
Iterative Properties of Birational Rowmotion II: Rectangles and Triangles
Authors: Grinberg Darij , Roby Tom 
Published: January 2020

Birational rowmotion — a birational map associated to any finite poset $P$ — has been introduced by Einstein and Propp as a far-reaching generalization of the (well-studied) classical rowmotion map on the set of order ideals of $P$. Continuing our exploration of this birational rowmotion, we prove that it has order $p+q$ on the $\left( p, q\right) $-rectangle poset (i.e., on the product of a $p$-element chain with a $q$-element chain); we also compute its orders on some triangle-shaped posets. In all cases mentioned, it turns out to have finite (and explicitly computable) order, a property it does not exhibit for general finite posets (unlike classical rowmotion, which is a permutation of a finite set). Our proof in the case of the rectangle poset uses an idea introduced by Volkov (arXiv:hep-th/0606094) to prove the $AA$ case of the Zamolodchikov periodicity conjecture; in fact, the finite order of birational rowmotion on many posets can be considered an analogue to Zamolodchikov periodicity. We comment on suspected, but so far enigmatic, connections to the theory of root posets.
Limits of Boolean Functions on $\mathbb{F}_p^n$
Authors: Hatami Hamed , Hatami Pooya , Hirst James 
Published: January 2020

We study sequences of functions of the form $\mathbb{F}_p^n \to \{0,1\}$ for varying $n$, and define a notion of convergence based on the induced distributions from restricting the functions to a random affine subspace. Using a decomposition theorem and a recently proven equi-distribution theorem from higher order Fourier analysis, we prove that the limits of such convergent sequences can be represented by certain measurable functions. We also show that every such limit object arises as the limit of some sequence of functions. These results are in the spirit of similar results which have been developed for limits of graph sequences. A more general, albeit substantially more sophisticated, limit object was recently constructed by Balázs Szegedy [Gowers norms, regularization and limits of functions on abelian groups. 2010. arXiv:1010.6211].
Wilf-Classification of Mesh Patterns of Short Length
Authors: Hilmarsson Ísak , Jónsdóttir Ingibjörg , Sigurðardóttir Steinunn , Viðarsdóttir Lína , Ulfarsson Henning 
Published: January 2020

This paper starts the Wilf-classification of mesh patterns of length 2. Although there are initially 1024 patterns to consider we introduce automatic methods to reduce the number of potentially different Wilf-classes to at most 65. By enumerating some of the remaining classes we bring that upper-bound further down to 56. Finally, we conjecture that the actual number of Wilf-classes of mesh patterns of length 2 is 46.
Weight of 3-Paths in Sparse Plane Graphs
Authors: Aksenov V. A. , Borodin O. V. , Ivanova A. O. 
Published: January 2020

We prove precise upper bounds for the minimum weight of a path on three vertices in several natural classes of plane graphs with minimum degree 2 and girth $g$ from 5 to 7. In particular, we disprove a conjecture by S. Jendrol' and M. Maceková concerning the case $g=5$ and prove the tightness of their upper bound for $g=5$ when no vertex is adjacent to more than one vertex of degree 2. For $g\ge8$, the upper bound recently found by Jendrol' and Maceková is tight.
Even More Infinite Ball Packings from Lorentzian Root Systems
Authors: Chen Hao 
Published: January 2020

Boyd (1974) proposed a class of infinite ball packings that are generated by inversions. Later, Maxwell (1983) interpreted Boyd's construction in terms of root systems in Lorentz spaces. In particular, he showed that the space-like weight vectors correspond to a ball packing if and only if the associated Coxeter graph is of "level 2"'. In Maxwell's work, the simple roots form a basis of the representations space of the Coxeter group. In several recent studies, the more general based root system is considered, where the simple roots are only required to be positively independent. In this paper, we propose a geometric version of "level'' for root systems to replace Maxwell's graph theoretical "level''. Then we show that Maxwell's results naturally extend to the more general root systems with positively independent simple roots. In particular, the space-like extreme rays of the Tits cone correspond to a ball packing if and only if the root system is of level $2$. We also present a partial classification of level-$2$ root systems, namely the Coxeter $d$-polytopes of level-$2$ with $d+2$ facets.
Closing Gaps in Problems related to Hamilton Cycles in Random Graphs and Hypergraphs
Authors: Ferber Asaf 
Published: January 2020

We show how to adjust a very nice coupling argument due to McDiarmid in order to prove/reprove in a novel way results concerning Hamilton cycles in various models of random graph and hypergraphs. In particular, we firstly show that for $k\geq 3$, if $pn^{k-1}/\log n$ tends to infinity, then a random $k$-uniform hypergraph on $n$ vertices, with edge probability $p$, with high probability (w.h.p.) contains a loose Hamilton cycle, provided that $(k-1)|n$. This generalizes results of Frieze, Dudek and Frieze, and reproves a result of Dudek, Frieze, Loh and Speiss. Secondly, we show that there exists $K>0$ such for every $p\geq (K\log n)/n$ the following holds: Let $G_{n,p}$ be a random graph on $n$ vertices with edge probability $p$, and suppose that its edges are being colored with $n$ colors uniformly at random. Then, w.h.p. the resulting graph contains a Hamilton cycle with for which all the colors appear (a rainbow Hamilton cycle). Bal and Frieze proved the latter statement for graphs on an even number of vertices, where for odd $n$ their $p$ was $\omega((\log n)/n)$. Lastly, we show that for $p=(1+o(1))(\log n)/n$, if we randomly color the edge set of a random directed graph $D_{n,p}$ with $(1+o(1))n$ colors, then w.h.p. one can find a rainbow Hamilton cycle where all the edges are directed in the same way.
Abelian Cayley Digraphs with Asymptotically Large Order for Any Given Degree
Authors: Aguiló Francesc , Fiol Miquel Àngel , Pérez Sonia 
Published: January 2020

Abelian Cayley digraphs can be constructed by using a generalization to $\mathbb{Z}^n$ of the concept of congruence in $\mathbb{Z}$. Here we use this approach to present a family of such digraphs, which, for every fixed value of the degree, have asymptotically large number of vertices as the diameter increases. Up to now, the best known large dense results were all non-constructive.
Locally Oriented Noncrossing Trees
Authors: Okoth Isaac Owino , Wagner Stephan 
Published: January 2020

We define an orientation on the edges of a noncrossing tree induced by the labels: for a noncrossing tree (i.e., the edges do not cross) with vertices $1,2,\ldots,n$ arranged on a circle in this order, all edges are oriented towards the vertex whose label is higher. The main purpose of this paper is to study the distribution of noncrossing trees with respect to the indegree and outdegree sequence determined by this orientation. In particular, an explicit formula for the number of noncrossing trees with given indegree and outdegree sequence is proved and several corollaries are deduced from it. Sources (vertices of indegree $0$) and sinks (vertices of outdegree $0$) play a special role in this context. In particular, it turns out that noncrossing trees with a given number of sources and sinks correspond bijectively to ternary trees with a given number of middle- and right-edges, and an explicit bijection is provided for this fact. Finally, the in- and outdegree distribution of a single vertex is considered and explicit counting formulas are provided again.
The Coupling Method for Inhomogeneous Random Intersection Graphs.
Authors: Rybarczyk Katarzyna 
Published: January 2020

We present new results concerning threshold functions for a wide family of random intersection graphs. To this end we improve and generalize the coupling method introduced for random intersection graphs so that it may be used for a wider range of parameters. Using the new approach we are able to tighten the best known results concerning random intersection graphs and establish threshold functions for some monotone properties of inhomogeneous random intersection graphs. Considered properties are: $k$-connectivity, matching containment and hamiltonicity.
An Exact Turán Result for Tripartite 3-Graphs
Authors: Sanitt Adam , Talbot John 
Published: January 2020

Mantel's theorem says that among all triangle-free graphs of a given order the balanced complete bipartite graph is the unique graph of maximum size. We prove an analogue of this result for 3-graphs. Let $K_4^-=\{123,124,134\}$, $F_6=\{123,124,345,156\}$ and $\mathcal{F}=\{K_4^-,F_6\}$: for $n\neq 5$ the unique $\mathcal{F}$-free 3-graph of order $n$ and maximum size is the balanced complete tripartite 3-graph $S_3(n)$ (for $n=5$ it is $C_5^{(3)}=\{123,234,345,145,125\}$). This extends an old result of Bollobás that $S_3(n) $ is the unique 3-graph of maximum size with no copy of $K_4^-=\{123,124,134\}$ or $F_5=\{123,124,345\}$.
A Combinatorial Proof of a Relationship Between Maximal $(2k-1,2k+1)$-Cores and $(2k-1,2k,2k+1)$-Cores
Authors: Nath Rishi , Sellers James A. 
Published: January 2020

Integer partitions which are simultaneously $t$-cores for distinct values of $t$ have attracted significant interest in recent years. When $s$ and $t$ are relatively prime, Olsson and Stanton have determined the size of the maximal $(s,t)$-core $\kappa_{s,t}$. When $k\geq 2$, a conjecture of Amdeberhan on the maximal $(2k-1,2k,2k+1)$-core $\kappa_{2k-1,2k,2k+1}$ has also recently been verified by numerous authors.In this work, we analyze the relationship between maximal $(2k-1,2k+1)$-cores and maximal $(2k-1,2k,2k+1)$-cores. In previous work, the first author noted that, for all $k\geq 1,$$$\vert \, \kappa_{2k-1,2k+1}\, \vert = 4\vert \, \kappa_{2k-1,2k,2k+1}\, \vert$$and requested a combinatorial interpretation of this unexpected identity. Here, using the theory of abaci, partition dissection, and elementary results relating triangular numbers and squares, we provide such a combinatorial proof.
On Erdős-Sós Conjecture for Trees of Large Size
Authors: Goerlich Agnieszka , Żak Andrzej 
Published: January 2020

Erdős and Sós conjectured that every graph $G$ of average degree greater than $k-1$ contains every tree of size $k$. Several results based upon the number of vertices in $G$ have been proved including the special cases where $G$ has exactly $k+1$ vertices (Zhou), $k+2$ vertices (Slater, Teo and Yap), $k+3$ vertices (Woźniak) and $k+4$ vertices (Tiner). We further explore this direction. Given an arbitrary integer $c\geq 1$, we prove Erdős-Sós conjecture in the case when $G$ has $k+c$ vertices provided that $k\geq k_0(c)$ (here $k_0(c)=c^{12}{\rm polylog}(c)$). We also derive a corollary related to the Tree Packing Conjecture.