相关论文: A topological proof of Terao's generalized Arrow's…

In this paper, Thue's Fundamentaltheorem is analysed. We show that it includes, and often strengthens, known effective irrationality measures obtained via the so-called hypergeometric method as well as showing that it can be applied to…

We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]

Analytic-bilinear approach for construction and study of integrable hierarchies, in particular, the KP hierarchy is discussed. It is based on the generalized Hirota identity. This approach allows to represent generalized hierarchies of…

We extend P\'olya's indicator diagram theory to encompass entire functions of order at most 1, allowing functions of maximal type. To do so, we introduce an extension of the complex plane in which indicator diagrams may be unbounded or even…

In 1987, I. Labuda proved a general representation theorem that, as a special case, shows that the topology of local convergence in measure is the minimal topology on Orlicz spaces and $L_{\infty}$. Minimal topologies connect with the…

In this paper, we prove a crucial theorem called Mirroring Theorem which affirms that given a collection of samples with enough information in it such that it can be classified into classes and subclasses then (i) There exists a mapping…

The main objects under consideration in this thesis are called maps, a certain class of graphs embedded on surfaces. Our problems have a powerful relatively recent tool in common, the so-called topological recursion (TR) introduced by…

In this paper we focus our efforts on studying how a preorder and topology can be made compatible. Thus we provide a characterization of those that are continuous-compatible. Such a characterization states that such topologies must be finer…

Answering a question of Diestel, we develop a topological notion of gammoids in infinite graphs which, unlike traditional infinite gammoids, always define a matroid. As our main tool, we prove for any infinite graph $G$ with vertex sets $A$…

The classical Arrow's Theorem answers "how can $n$ voters obtain a collective preference on a set of outcomes, if they have to obey certain constraints?" We give an analogue in the judgment aggregation framework of List and Pettit,…

This is the author's PhD thesis. It is a contribution to categorical logic, in particular to the theory of realizability toposes. While the tools of categorical logic have proven very successful in analyzing and organizing proof theoretic…

In 1980's, Thurston established a combinatorial characterization for post-critically finite rational maps. This criterion was then extended by Cui, Jiang, and Sullivan to sub-hyperbolic rational maps. The goal of this paper is to present a…

Let $X,Y$ be two irreducible subvarieties of the projective space $\mathbb{P}^n$, and $d\geq 1$ an integer number. The main result of this paper is an algorithm to construct {\bf explicitly}, in terms of $d$ and the ideals defining $X$ and…

In [1] M. Baker and S. Norine developed a theory of divisors and linear systems on graphs, and proved a Riemann-Roch Theorem for these objects (conceived as integer-valued functions on the vertices). In [2] and [3] the authors generalized…

This thesis proposes a combinatorial generalization of a nilpotent operator on a vector space. The resulting object is highly natural, with basic connections to a variety of fields in pure mathematics, engineering, and the sciences. For the…

The measurable Riemann mapping theorem proved by Morrey and in some particular cases by Ahlfors, Lavrentiev and Vekua, says that any measurable almost complex structure on $\rd$ ($S^2$) with bounded dilatation is integrable: there is a…

Razborov's flag algebra forms a powerful framework for deriving asymptotic inequalities between induced subgraph densities, underpinning many advances in extremal graph theory. This survey introduces flag algebra to computer scientists…

We discuss topological versions of the closed graph theorem, where continuity is inferred from near continuity in tandem with suitable conditions on source or target spaces. We seek internal characterizations of spaces satisfying a closed…

In this article, we revise Conway's Law from a mathematical point of view. By introducing a task graph, we first rigorously state Conway's Law based on the homomorphisms in graph theory for the software system and the organizations that…

Using Dwork's theory, we prove a broad generalisation of his famous p-adic formal congruences theorem. This enables us to prove certain p-adic congruences for the generalized hypergeometric series with rational parameters; in particular,…