相关论文: Barbara Rokowska's combinatorial research with her…

Participation of mathematicians in the implementation of economic projects in Poland, in which mathematics-based methods played an important role, happened sporadically in the past. Usually methods known from publications and verified were…

Menger's basis property is a generalization of $\sigma$-compactness and admits an elegant combinatorial interpretation. We introduce a general combinatorial method to construct non $\sigma$-compact sets of reals with Menger's property.…

The dissertation describes ergodic properties of some stochastic dynamical systems generated by Markov chains with values in the state space which is a Polish space. The mathematical model describing the process of cell division is…

This is an exposition of the contributions of L\'aszl\'o Lov\'asz to mathematics and computer science written on the occasion of the bestowal of the Abel Prize~2021 to him. Our survey, of course, cannot be exhaustive. We sketch remarkable…

A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees,…

Shortly after Szemer\'edi's proof that a set of positive upper density contains arbitrarily long arithmetic progressions, Furstenberg gave a new proof of this theorem using ergodic theory. This gave rise to the field of ergodic Ramsey…

This paper presents a brief account of some of the my early research interests. This historical account starts from my laurea thesis on Signal Theory and my master thesis on Computation Theory. It recalls some results in Combinatory Logic…

With this work we aim to show how Mathematica can be a useful tool to investigate properties of combinatorial structures. Specifically, we will face enumeration problems on independent subsets of powers of paths and cycles, trying to…

A paper of the first author and Zilke proposed seven combinatorial problems around formulas for the characteristic polynomial and the exponents of an isolated quasihomogeneous singularity. The most important of them was a conjecture on the…

One of the central problems in additive combinatorics is to determine how large a subset of the first $N$ integers can be before it is forced to contain $k$ elements forming an arithmetic progression. Around 25 years ago, Gowers proved the…

I review the milestones of the mathematical work of Krzysztof P. Wojciechowski. This will at the same time be a tour of Analysis and Geometry of Boundary Value Problems. Starting in the 80s I will discuss the spectral flow and the general…

We summarize researches - in great deal jointly with my host Y. Sarantopoulos and his PhD. students V. Anagnostopoulos and A. Pappas - started by a Marie Curie fellowship in 2001 and is still continuing. The project was to study…

This habilitation (German variant of a PhD on top of a PhD) thesis presents the quintessence of the ideas and experiences with Groebner Bases of Birgit Reinert. She died unexpectedly without providing an abstract. As arXiv requires an…

In this paper we present the first-ever computer formalization of the theory of Gr\"obner bases in reduction rings, which is an important theory in computational commutative algebra, in Theorema. Not only the formalization, but also the…

In symmetric groups, studies of permutation factorizations or triples of permutations satisfying certain conditions have a long history. One particular interesting case is when two of the involved permutations are long cycles, for which…

We define combinatorial representations of finite skew braces and use this idea to produce a database of skew braces of small size. This database is then used to explore different concepts of the theory of skew braces such as ideals, series…

Arithmetic combinatorics is often concerned with the problem of bounding the behaviour of arbitrary finite sets in a group or ring with respect to arithmetic operations such as addition or multiplication. Similarly, combinatorial geometry…

In a seminal paper "Volumen und Oberfl\"ache" (1903), Minkowski introduced the basic notion of mixed volumes and the corresponding inequalities that lie at the heart of convex geometry. The fundamental importance of characterizing the…

We consider a combinatorial problem occurring naturally in a group theoretical setting and provide a constructive solution in a special case. More precisely, in 1999 the author established a logarithmic bound for the derived length of the…

This paper starts with a biographical sketch of the life of Josef Meixner. Then his motivations to work on orthogonal polynomials and special functions are reviewed. Meixner's 1934 paper introducing the Meixner and Meixner-Pollaczek…