相关论文: A course on Combinatorial Algorithms

This is a companion piece to my paper on "Example-Based Procedural Modeling Using Graph Grammars." This paper examines some of the theoretical issues in more detail. This paper discusses some more complex parts of the implementation, why…

Extremal Combinatorics is among the most active topics in Discrete Mathematics, dealing with problems that are often motivated by questions in other areas, including Theoretical Computer Science and Information Theory. This paper contains a…

These lecture notes have been developed for the course Computational Social Choice of the Artificial Intelligence MSc programme at the University of Groningen. They cover mathematical and algorithmic aspects of voting theory.

This text is a slightly edited version of lecture notes for a course I gave at ETH, during the Winter term 2000-2001, to undergraduate Mathematics and Physics students. Contents: Chapter 1 - Examples of Dynamical Systems Chapter 2 -…

This thesis explores a number of online machine learning algorithms. From a theoret- ical perspective, it assesses their employability for a particular function approximation problem where the analytical models fall short. Furthermore, it…

The study proves the existence of an algorithm to receive all elements of a class of binary matrices without obtaining redundant elements, e. g. without obtaining binary matrices that do not belong to the class. This makes it possible to…

Lecture notes of a short course on geometric control theory given in Brasov, Romania (August 2018) and in Jyv\"askyl\"a, Finland (February 2019).

We introduce new types of local algorithms, which we call "ASI Algorithms", and use them to demonstrate a link between descriptive and computable combinatorics. This allows us to unify arguments from the two fields, and also sometimes to…

This is a survey of recent developments in combinatorics. The goal is to give a big picture of its many interactions with other areas of mathematics, such as: group theory, representation theory, commutative algebra, geometry (including…

This chapter introduces and elaborates on the fruitful interplay of coding theory and algebraic combinatorics, with most of the focus on the interaction of codes with combinatorial designs, finite geometries, simple groups, sphere packings,…

The authors describe their approach to teaching a course on finite fields and combinatorial applications, including block designs and error-correcting codes, using a hybrid of lectures and active learning. Under the discussed classroom…

Since about 10 years ago, University of Applied Science and Technology (UAST) in Iran has admitted students in discontinuous associate degree by modular method, so that almost 100,000 students are accepted every year. Although the first aim…

Recently, additive combinatorics has blossomed into a vibrant area in mathematical sciences. But it seems to be a difficult area to define - perhaps because of a blend of ideas and techniques from several seemingly unrelated contexts which…

As the field of recommender systems has developed, authors have used a myriad of notations for describing the mathematical workings of recommendation algorithms. These notations ap-pear in research papers, books, lecture notes, blog posts,…

These are notes of my lecture courses given in the summer of 2024 in the School on Number Theory and Physics at ICTP in Trieste and in the 27th Brazilian Algebra Meeting at IME-USP in S\~ao Paulo. We give an elementary account of $p$-adic…

In this paper an algorithm designed for large databases is introduced for the enhancement of pass rates in mathematical university lower division courses with several sections. Using integer programming techniques, the algorithm finds the…

In recent decades, the field of quantum computing has experienced remarkable progress. This progress is marked by the superior performance of many quantum algorithms compared to their classical counterparts, with Shor's algorithm serving as…

This material complements David Chandler's Introduction to Modern Statistical Mechanics (Oxford University Press, 1987) in a graduate-level, one-semester course I teach in the Department of Chemistry at Duke University. Students enter this…

This paper demonstrates the systematic use of combinatorial coverage for selecting and characterizing test and training sets for machine learning models. The presented work adapts combinatorial interaction testing, which has been…

This draft is intended to be used as class notes for a grad course on rigorous statistical mechanics at math department of UFMG. It should be considered as a very prelimivary version and a work in progress. Several chapters lack references,…