相关论文: A Combinatorial Classification of Postsingularly F…
We introduce bijections between families of rooted maps with unfixed genus and families of so-called blossoming trees endowed with an arbitrary forward matching of their leaves. We first focus on Eulerian maps with controlled vertex…
We exhibit an analogy between the problem of pushing forward measurable sets under measure preserving maps and linear relaxations in combinatorialoptimization. We show how invariance of hyperfiniteness of graphings under local isomorphism…
We introduce a general class of combinatorial objects, which we call \emph{multi-complexes}, which simultaneously generalizes graphs, multigraphs, hypergraphs and simplicial and delta complexes. We introduce a natural algebra of…
We provide an algorithm to classify the asymptotic sets of the dominant polynomial mappings $F: \C^3 \to \C^3$ of degree 2, using the definition of the so-called "{\it fa\c{c}ons}" in \cite{Thuy}. We obtain a classification theorem for the…
The topological classification of the inner mappings on the fully invariant regular components of the wandering set with a special attracting boundary up to the topological conjugacy is defined in terms of distinguishing graph. Two inner…
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…
Some polynomials $P$ with rational coefficients give rise to well defined maps between cyclic groups, $\Z_q\longrightarrow\Z_r$, $x+q\Z\longmapsto P(x)+r\Z$. More generally, there are polynomials in several variables with tuples of rational…
The characteristic polynomial plays an important role in study of hyperplane arrangements. There are several refinements of the characteristic polynomial. One of them is the coboundary polynomial defined by Crapo. Another refinement is the…
We develop a systematic and fully explicit approach to the evaluation of binomial sums involving reciprocals of binomial coefficients based on Beta integral techniques. Starting from a simple integral representation, we provide a derivation…
We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…
We extend the shell and kernel reductions for hyperexponential functions over the field of rational functions to a monomial extension. Both of the reductions are incorporated into one algorithm. As an application, we present an additive…
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic encodings. The complete Prolog code is available at…
We answer the question which conjunctive queries are uniquely characterized by polynomially many positive and negative examples, and how to construct such examples efficiently. As a consequence, we obtain a new efficient exact learning…
In this paper, we have studied 'absorbing' and 'balanced' sets in an Exponential Vector Space (\emph{evs} in short) over the field $\mathbb K$ of real or complex. These sets play pivotal role to describe several aspects of a topological…
A new method of analysing positive bistochastic maps on the algebra of complex matrices $M_{3}$ has been proposed. By identifying the set of such maps with a convex set of linear operators on $\mathbb{R}^{8}$, one can employ techniques from…
Consider the collection of hyperplanes in $\mathbb{R}^n$ whose defining equations are given by $\{x_i + x_j = 0\mid 1\leq i<j\leq n\}$. This arrangement is called the threshold arrangement since its regions are in bijection with labeled…
We give new lower bounds for the (higher) topological complexity of a space, in terms of the Lusternik-Schnirelmann category of a certain auxiliary space. We also give new lower bounds for the rational topological complexity of a space, and…
We survey interactions between the topology and the combinatorics of complex hyperplane arrangements. Without claiming to be exhaustive, we examine in this setting combinatorial aspects of fundamental groups, associated graded Lie algebras,…
We construct explicit polynomial realizations of some combinatorial Hopf algebras based on various kind of trees or forests, and some more general classes of graphs, ranging from the Connes-Kreimer algebra to an algebra of labelled forests…
The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…