Biologically Active Substances of Vitis amurensis Rupr.: Preventing Premature Aging by Juliya A. Praskova, Tatyana F. Kiseleva, Irina Yu. Reznichenko, Nina A. Frolova, Natalia V. Shkrabtak, Yulia Lawrence

“…Due to its comprehensive phytochemical assessment, it can find wider application in nutritive sciences, cosmetic industry, and food combinatorics. Fruits and leaves of Vitis amurensis Rupr. proved to possess a high antioxidant activity due to polyphenols, resveratrol, B vitamins, and vitamin C.…”
Get full text

Optimasi Rute Rencana Perjalanan Pesawat Menggunakan Algoritma Late Acceptance Hill Climbing (Studi Kasus : Travelling Salesman Challenge 2.0) by Ahmad Muklason, I Gusti Agung Premananda

“…Abstract The Traveling Salesman Problem (TSP) is a classic problem that is popularly researched in the field of combinatorics optimization. This problem aims to determine the shortest travel route to visit each location exactly once and, at the end of the trip, must return to where the trip started. …”
Get full text

Enrichment of Circular Code Motifs in the Genes of the Yeast Saccharomyces cerevisiae by Christian J. Michel, Viviane Nguefack Ngoune, Olivier Poch, Raymond Ripp, Julie D. Thompson

“…Since 1996, the theory of circular codes in genes has mainly been developed by analysing the properties of the 20 trinucleotides of X , using combinatorics and statistical approaches. For the first time, we test this theory by analysing the X motifs, i.e., motifs from the circular code X , in the complete genome of the yeast Saccharomyces cerevisiae. …”
Get full text

Simulation of arms distribution strategies by combat zones to create military parity of forces by Oleg Fedorovich, Mikhail Lukhanin, Oleksandr Prokhorov, Oleg Slomchynskyi, Oleksii Hubka, Yuliia Leshchenko

“…Using set-theoretical analysis, methods of combinatorics, and enumeration theory, a systematic presentation of the distribution process of weapons is created. …”
Get full text

Comparison of metaheuristics to measure gene effects on phylogenetic supports and topologies by Régis Garnier, Christophe Guyeux, Jean-François Couchot, Michel Salomon, Bashar Al-Nuaimi, Bassam AlKindy

“…Results As an exhaustive study of all core genes combination is untractable in practice, since the combinatorics of the situation made it computationally infeasible, we investigate three well-known metaheuristics to solve this optimization problem. …”
Get full text

Diversity-inducing probability measures for machine learning by Li, Chengtao,Ph. D.Massachusetts Institute of Technology.

Get full text

Enumerative and algebraic aspects of matroids and hyperplane arrangements by Ardila, Federico, 1977-

Get full text

The stochastic operator approach to random matrix theory by Sutton, Brian D. (Brian David)

Get full text

Towards birational aspects of moduli space of curves by Dwivedi, Shashank S. (Shashank Shekhar)

Get full text

A Branch and Bound Algorithm for Counting Independent Sets on Grid Graphs by Guillermo De Ita, Pedro Bello, Mireya Tovar

“…This problem has many applications in combinatorics, physics, chemistry and computer science. …”
Get full text

KEMAMPUAN LITERASI MATEMATIS CALON GURU DALAM PENGAJUAN MASALAH BERORIENTASI DATA BERDASARKAN KEMAMPUAN MATEMATIKA by Edy Setiyo Utomo

“…The literacy skills of prospective teachers with high mathematical abilities at problem posing are considered good, because they are able to fulfill each indicator, are able to present problems in various forms of representation, link various mathematical concepts in the form of algebra and combinatorics, and require many strategies and stages of completion. …”
Get full text

Iconic Character of Bestiary Images in the Novels of F. Werfel and E. Canetti by Natalya Seibel, Julia Kazakova, Elena Shastina, Nailya Ziganshina

“…The functioning of animal images in the text, their nomination, combinatorics, communication with the elements, time periods, and behavioural patterns are the way of the study of the philosophical foundations of the author's world picture. …”
Get full text

A Simple Combinatorial Proof of Szemerédi's Theorem via Three Levels of Infinities by Renling Jin

“…Szemerédi's theorem, a cornerstone of additive combinatorics, states that for every $\delta>0$ and every positive integer $k$ there exists a positive integer $n$ such that every subset $A$ of $\{1,2,\dots,n\}$ of size at least $\delta n$ contains an arithmetic progression of length $k$. …”
Get full text

EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS by DOMINIC W. BERRY, ANDREW M. CHILDS, RICHARD CLEVE, ROBIN KOTHARI, ROLANDO D. SOMMA

Get full text

Extensions to the method of multiplicities, with applications to Kakeya sets and mergers by Dvir, Zeev, Kopparty, Swastik, Saraf, Shubhangi, Sudan, Madhu

“…We extend the "method of multiplicities" to get the following results, of interest in combinatorics and randomness extraction. 1) We show that every Kakeya set (a set of points that contains a line in every direction) in F [subscript q] [superscript n] must be of size at least q [superscript n}/2 [superscript n]. …”
Get full text

Distinct fronto-temporal substrates of distributional and taxonomic similarity among words: evidence from RSA of BOLD signals by Francesca Carota, Hamed Nili, Friedemann Pulvermüller, Nikolaus Kriegeskorte

“…Taxonomy may shape long-term lexical-semantic representations in memory consistently with the sensorimotor details of semantic categories, whilst distributional knowledge in the LIFG (BA 47) may enable semantic combinatorics in the context of language use.Our approach helps to elucidate the nature of semantic representations essential for understanding human language.…”
Get full text

Star Chromatic Index of 1-Planar Graphs by Yiqiao Wang, Juan Liu, Yongtang Shi, Weifan Wang

Get full text

18.304 Undergraduate Seminar in Discrete Mathematics, Spring 2006 by Kleitman, Daniel

“…This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. …”
Get full text

Fourientations and the Tutte polynomial by Backman, Spencer, Hopkins, Sam

“…This work unifies and extends earlier results for fourientations due to Gessel and Sagan (Electron J Combin 3(2):Research Paper 9, 1996), results for partial orientations due to Backman (Adv Appl Math, forthcoming, 2014. arXiv:1408.3962), and Hopkins and Perkinson (Trans Am Math Soc 368(1):709–725, 2016), as well as results for total orientations due to Stanley (Discrete Math 5:171–178, 1973; Higher combinatorics (Proceedings of NATO Advanced Study Institute, Berlin, 1976). …”
Get full text
Get full text

Counting polynomial subset sums by Li, Jiyou, Wan, Daqing

“…Then $$\begin{aligned} \left| N_f(D, k, b)-\frac{1}{n}{n-c \atopwithdelims ()k}\right| \le {\delta (n)(n-c)+(1-\delta (n))\left( C_dnp^{-\frac{1}{d}}+c\right) +k-1\atopwithdelims ()k}, \end{aligned}$$ N f ( D , k , b ) - 1 n n - c k ≤ δ ( n ) ( n - c ) + ( 1 - δ ( n ) ) C d n p - 1 d + c + k - 1 k , answering an open question raised by Stanley (Enumerative combinatorics, 1997) in a general setting, where $$\delta (n)=\sum _{i\mid n, \mu (i)=-1}\frac{1}{i}$$ δ ( n ) = ∑ i ∣ n , μ ( i ) = - 1 1 i and $$C_d=e^{1.85d}$$ C d = e 1.85 d . …”
Get full text