相关论文: A Combinatorial Classification of Postsingularly F…

The major challenge in designing a discriminative learning algorithm for predicting structured data is to address the computational issues arising from the exponential size of the output space. Existing algorithms make different assumptions…

In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…

To a given nonsingular triangular matrix A with entries from a ring, we associate a weighted bipartite graph G(A) and give a combinatorial description of the inverse of A by employing paths in G(A). Under a certain condition, nonsingular…

The paper deals with Newton maps of complex exponential functions and a surgery tool developed by P. Ha\"issinsky. The concept of "Postcritically minimal" Newton maps of complex exponential functions are introduced, analogous to…

We show that the set of complex points in the moduli space of polynomials of degree d corresponding to post-critically finite polynomials is a set of algebraic points of bounded height. It follows that for any B, the set of conjugacy…

We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of nonnegative integers whose equational theory has no finite axiomatisation, and show this also holds if…

We consider the problem of enumeration of planar maps and revisit its one-matrix model solution in the light of recent combinatorial techniques involving conjugated trees. We adapt and generalize these techniques so as to give an…

We describe the canonical correspondence between set of all finite metric spaces and set of special symmetric convex polytopes, and formulate the problem about classification of the metric spaces in terms of combinatorial structure of those…

We study eigenvalues along periodic cycles of post-critically finite endomorphisms of $\mathbb{CP}^n$ in higher dimension. It is a classical result when $n = 1$ that those values are either $0$ or of modulus strictly bigger than $1$. It has…

We describe a mathematical structure that can give extensional denotational semantics to higher-order probabilistic programs. It is not limited to discrete probabilities, and it is compatible with integration in a way the models that have…

Each graph and choice of a commutative ring gives rise to an associated graphical group. In this article, we introduce and investigate graph polynomials that enumerate conjugacy classes of graphical groups over finite fields according to…

Constellations and hypermaps generalize combinatorial maps, i.e. embedding of graphs in a surface, in terms of factorization of permutations. In this paper, we extend a result of Jackson and Visentin (1990) stating an enumerative relation…

Differentiable conjugacies link dynamical systems that share properties such as the stability multipliers of corresponding orbits. It provides a stronger classification than topological conjugacy, which only requires qualitative similarity.…

In this article we give a classification of the sub-groups in PSL(2,Z) and of the conjugacy classes of these sub-groups by the mean of an combinatorial invariant: some trivalent diagrams (dotted or not). We give explicit formulae enabling…

We use the theory of self-similar groups to enumerate all combinatorial classes of non-exceptional quadratic Thurston maps with fewer than five postcritical points. The enumeration relies on our computation that the corresponding maps on…

We show that for many complex parameters a, the set of points that converge to infinity under iteration of the exponential map f(z)=e^z+a is connected. This includes all parameters for which the singular value escapes to infinity under…

In this paper, we introduce differential exponential maps in Cartesian differential categories, which generalizes the exponential function $e^x$ from classical differential calculus. A differential exponential map is an endomorphism which…

In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…

We find all quadratic post-critically finite (PCF) rational maps defined over the rationals. We describe an algorithm to search for possibly PCF maps. Using the algorithm, we eliminate all but twelve rational maps, all of which are…

Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…