相关论文: Bounding and dominating number of families of func…

Using standard methods (due to Janson, Stein-Chen, and Talagrand) from probabilistic combinatorics, we explore the following general theme: As one progresses from each member of a family of objects ${\cal A}$ being "covered" by at most one…

We solve three enumerative problems concerning families of planar maps. More precisely, we establish algebraic equations for the generating function of non-separable triangulations in which all vertices have degree at least d, for a certain…

We consider the relationship between learnability of a "base class" of functions on a set $X$, and learnability of a class of statistical functions derived from the base class. For example, we refine results showing that learnability of a…

We study the structure of the family of numerical semigroups with fixed multiplicity and Frobenius number. We give an algorithmic method to compute all the semigroups in this family. As an application we compute the set of all numerical…

There are different meanings of foundation of mathematics: philosophical, logical, and mathematical. Here foundations are considered as a theory that provides means (concepts, structures, methods etc.) for the development of whole…

For processes involving structure functions and/or fragmentation functions, arguments that there is a part that dominates the NLO corrections are briefly reviewed. The arguments are tested against more recent NLO and in particular NNLO…

Normal and composition series of modules enumerated by ordinal numbers are studied. The Jordan-Holder theorem for them is discussed.

The results of the renormalization group are commonly advertised as the existence of power law singularities near critical points. The classic predictions are often violated and logarithmic and exponential corrections are treated on a…

Families of objects appear in several contexts, like algebraic topology, theory of deformations, theoretical physics, etc. An unified coordinate-free algebraic framework for families of geometrical quantities is presented here, which allows…

We say that a graph $H$ dominates another graph $H'$ if the number of homomorphisms from $H'$ to any graph $G$ is dominated, in an appropriate sense, by the number of homomorphisms from $H$ to $G$. We study the family of dominating graphs,…

We introduce a large family of combinatorial objects, called standard puzzles, defined by very simple rules. We focus on the standard puzzles for which the enumeration problems can be solved by explicit formulas or by classical numbers,…

A new tree model is introduced based on ordered trees, by distinguishing exactly one child of each node that \emph{has} children. The basic enumeration leads to a cubic equation of the generating function. The extraction of its coefficients…

We establish bounds on a finite separable extension of function fields in terms of the relative class number, thus reducing the problem of classifying extensions with a fixed relative class number to a finite computation. We also solve the…

Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets being enumerated by…

We first provide an overview of several results dealing with the genus of a division algebra and highlight the role of ramification in its analysis. We then give a survey of recent developments on the genus problem for simple algebraic…

A graph $G$ is defined encapsulating the number theoretic notion of the Fundamental Theorem of Arithmetic. We then provide a graph theoretic approach to the fundamental results on the coprimality of two natural numbers, through the use of…

Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…

These are classified by the direction of approximation (from above or below), the set family types (partition or covering) of simple functions, the coefficient signature (non-negative or signed), and cardinal number of terms of simple…

Evidences have suggested that counting representations are sometimes tractable even when the corresponding classification problem is almost impossible, or "wild" in a precise sense. Such counting problems are directly related to matrix…

Matrices over the dual numbers are considered. We propose an approach to classify these matrices up to similarity. Some preliminary results on the realization of this approach are obtained. In particular, we produce explicitly canonical…