arXiv, 2013 We define two recursive functions obtained by decomposition of a given interval into four close parts and prove two lemmas which determine features of these functions.
arxiv
The journey of the union-closed sets conjecture [PDF]
arXiv, 2013 We survey the state of the union-closed sets conjecture.
arxiv
Two-connected spanning subgraphs with at most $\frac{10}{7}$OPT edges [PDF]
arXiv, 2016 We present a $\frac{10}{7}$-approximation algorithm for the minimum two-vertex-connected spanning subgraph problem.
arxiv
On discrete field theory properties of the dimer and Ising models and their conformal field theory limits [PDF]
arXiv, 2011 We study various mathematical aspects of discrete models on graphs, specifically the Dimer and the Ising models. We focus on proving gluing formulas for individual summands of the partition function. We also obtain partial results regarding conjectured limits realized by fermions in rational conformal field theories.
arxiv
A characterization of substitutive sequences using return words [PDF]
Discrete Mathematics 179 (1998) 89-101, 2008 We prove that a sequence is primitive substitutive if and only if the set of its derived sequences is finite; we defined these sequences here.
arxiv
A bipartite graph with non-unimodal independent set sequence [PDF]
arXiv, 2013 We show that the independent set sequence of a bipartite graph need not be unimodal.
arxiv
Drawing complete multipartite graphs on the plane with restrictions on crossings [PDF]
arXiv, 2013 We introduce the concept of NIC-planar graphs and present the full characterization of NIC-planar complete k-partite graphs.
arxiv
Steps Toward a Philosophy for Mathematicians. [PDF]
Math Intell, 2023 Fenstad JE.
europepmc +1 more source
Linear time Constructions of some $d$-Restriction Problems [PDF]
arXiv, 2014 We give new linear time globally explicit constructions for perfect hash families, cover-free families and separating hash functions.
arxiv
The analysis of the implementation of RBL-STEM learning materials in improving student's meta-literacy ability to solve wallpaper decoration problems using local antimagic graph coloring techniques. [PDF]
Heliyon, 2023 Dafik +4 more
europepmc +1 more source