Search Results - combinatorics) Keywords

4-tangrams are 4-avoidable by Ochem, Pascal, Pierron, Théo

“…A tangram is a word in which every letter occurs an even number of times. Thus it can be cut into parts that can be arranged into two identical words. The…”
Get full text

Watson-Crick conjugates of words and languages by Mahalingam, Kalpana, Maity, Anuran

“…In this work, we explore the concept of Watson-Crick conjugates, also known as $θ$-conjugates (where $θ$ is an antimorphic involution), of words and languages…”
Get full text

Words avoiding the morphic images of most of their factors by Ochem, Pascal, Rosenfeld, Matthieu

“…We say that a finite factor $f$ of a word $w$ is \emph{imaged} if there exists a non-erasing morphism $m$, distinct from the identity, such that $w$ contains…”
Get full text

Combinatorics of nondeterministic walks by Élie de Panafieu, Wallner, Michael

“…This paper introduces nondeterministic walks, a new variant of one-dimensional discrete walks. The main difference to classical walks is that its…”
Get full text

Analysis of Students' Combinatorial Thinking Model in Solving Combinatorics Problems by Desfitri, Rita

“…The purpose of this study was to analyze students’ combinatorial thinking in solving combinatorics problems…”
Get full text

A logical limit law for $231$-avoiding permutations by Albert, Michael, Bouvel, Mathilde, Féray, Valentin, Noy, Marc

“… in $[0,1]$. Our tools come mainly from analytic combinatorics and singularity analysis…”
Get full text

Efficient Enumeration of Non-isomorphic Interval Graphs by Mikos, Patryk

“… In this paper, we improve their algorithm and achieve O([n.sup.3] logn) time delay. We also extend the catalog of these graphs providing a list of all non-isomorphic interval graphs for all n up to 15. Keyword…”
Get full text

The Fractal Nature of Combinatorial Sets and Finding Formulas for Combinatorial Numbers by Timofieva, N. K.

“… Using the fractal properties of the sets, an approach to solving enumeration problems in combinatorics is developed…”
Get full text

Extended formulations in combinatorial optimization by Conforti, Michele, Cornuéjols, Gérard, Zambelli, Giacomo

“…This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By “perfect formulation”, we mean a system of linear…”
Get full text

Humanitarian supply chain: a bibliometric analysis and future research directions by Fosso Wamba, Samuel

“…Humanitarian supply chain (HSC) has attracted enormous interest from both practitioners and academics lately, mainly because of its essential role in curbing…”
Get full text

A remark on Kashin’s discrepancy argument and partial coloring in the Komlós conjecture by Bandeira, Afonso S., Maillard, Antoine, Zhivotovskiy, Nikita

“…In this expository note, we discuss an early partial coloring result of B. Kashin (1985). Although this result only implies Spencer’s six standard deviations…”
Get full text

Combinatorics, groups, algorithms, and complexity: conference in honor of Laci Babai's 60th birthday by Seress, Akos, Szegedy, Mario

“…This special issue of Discrete Mathematics & Theoretical Computer Science is dedicated to the conference Combinatorics, Groups, Algorithms, and Complexity held at The Ohio State University between March 21-25, 2010. Honoring Laszlo (Laci…”
Get full text

An efficient approach for searching optimal multi-keywords coverage routes by Yang, Rong, Niu, Baoning, Jin, Pengfei

“…Keyword-aware optimal route queries are a combinatorial optimization problem with three factors, namely keyword coverage, route budget constraint and route popularity, which is NP-hard…”
Get full text

On Colorings of 3-Homogeneous Hypergraphs in 3 Colors by Akolzin, I. A.

“…In this paper, we examine the value m(n, r) in the Erdős–Hajnal problem. Using various methods, we obtain the estimate 27 ≤ m(3) ≤ 35…”
Get full text

Statistical Mechanics, Integrability and Combinatorics by Fendley, Paul, Pronko, Andrei, Reshetikhin, Nicolai, Wiegmann, Paul, Zinn- Justin, Paul

“… Keywords. Statistical mechanics, lattice models, quantum integrability, exact results, combinatorics, tilings, dimers, growth processes, limit shape phenomena, random matrices, random surfaces, determinantal…”
Get full text

Two-stage stochastic lot-sizing problem under cost uncertainty by Zhou, Zhili, Guan, Yongpei

“…For production planning problems, cost parameters can be uncertain due to marketing activities and interest rate fluctuation. In this paper, we consider a…”
Get full text

Development of collaboration matrix using co-occurrence and combinatoric system as scientometrics analysis by Riyanto, Slamet, Subagyo, Hendro, Marlina, Ekawati, Yaniasih, Yaniasih, Rodiah, Rodiah

“… Design/methodology/approach - This study takes metadata of the author's name, author's affiliate, and keyword from National Scientific Repository (RIN…”
Get full text

The Methodology of Teaching Algorithms of Combinatorics: Permutations, Combinations, Arrangements by MANDARIA, George

“…In this article we have described the methodology for teaching the algorithms of combinatorics which are often used when solving tasks of informatics…”
Get full text

On Transfinite Levels of the Ershov Hierarchy by Peng, Cheng

“…In this thesis, we study Turing degrees in the context of classical recursion theory. What we are interested in is the partially ordered structures $\mathcal…”
Get full text

Classifying human promoters by occupancy patterns identifies recurring sequence elements, combinatorial binding, and spatial interactions by Yang, Xinyi, Vingron, Martin

“…Background Characterizing recurring sequence patterns in human promoters has been a challenging undertaking even nowadays where a near-complete overview of…”
Get full text