相关论文: Universality theorems for generalized splines

For any finite totally ordered set, the multisets of intervals form an abelian category. Various classes of subcategories admit natural combinatorial descriptions, and counting them yields familiar integer sequences. Surprisingly, in some…

Given a recollement of three proper dg algebras over a noetherian commutative ring, e.g. three algebras which are finitely generated over the base ring, which extends one step downwards, it is shown that there is a short exact sequence of…

We furnish any category of a universal (co)homology theory. Universal (co)homologies and universal relative (co)homologies are obtained by showing representability of certain functors and take values in $R$-linear abelian categories of…

In this paper the concept of $\mathbb{F}$-functorial of a finite group was introduced. These functorials have many properties of the Fitting subgroup of a soluble group and the generalized Fitting subgroup of a finite group. It was shown…

We construct infinite families of graphs that are determined by their generalized spectrum. This construction is based on new formulae for the determinant of the walk matrix of a graph. The graphs constructed here all satisfy a lower…

We prove a general structure theorem for finitely presented torsion modules over a class of commutative rings that need not be Noetherian. As a first application, we then use this result to study the Weil- \'etale cohomology groups of…

We apply model theoretic methods to the problem of existence of countable universal graphs with finitely many forbidden connected subgraphs. We show that to a large extent the question reduces to one of local finiteness of an…

Asymptotic expansions of Gaussian integrals may often be interpreted as generating functions for certain combinatorial objects (graphs with additional data). In this article we discuss a general approach to all such cases using colored…

Given a family $\mathcal{H}$ of graphs, a graph $G$ is called $\mathcal{H}$-universal if $G$ contains every graph of $\mathcal{H}$ as a subgraph. Following the extensive research on universal graphs of small size for bounded-degree graphs,…

In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures of a given type. The theory of combinatorial species is a novel toolset which provides a rigorous foundation for dealing with the…

Given an oriented surface of positive genus with finitely many punctures, we classify the finite orbits of the mapping class group action on the moduli space of semisimple complex special linear two dimensional representations of the…

In this paper, we inspect a relatively unexplored notion of finite generation in semirings, namely semirings in which all congruences are finitely generated. Such semirings are dubbed Congruence Noetherian. After developing sufficient…

Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…

Let G be a graph with vertices V and edges E. Let F be the union-closed family of sets generated by E. Then F is the family of subsets of V without isolated points. Theorem: There is an edge e belongs to E such that |{U belongs to F | e…

We represent the universal Menger curve as the topological realization $|\mathbb{M}|$ of the projective Fra\"iss\'e limit ${\mathbb M}$ of the class of all finite connected graphs. We show that $\mathbb{M}$ satisfies combinatorial analogues…

A spectral set in R^n is a set X of finite Lebesgue measure such that L^2(X) has an orthogonal basis of exponentials. It is conjectured that every spectral set tiles R^n by translations. A set of translations T has a universal spectrum if…

We introduce a new graph invariant of finite groups that provides a complete characterization of the splitting types of unramified prime ideals in normal number field extensions entirely in terms of the Galois group. In particular, each…

In this note we give a new existence proof for the universal extension classes for $GL_2$ previously constructed by Friedlander and Suslin via the theory of strict polynomial functors. The key tool in our approach is a calculation of Parker…

Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H in F is contained in G as a subgraph. The construction of sparse universal graphs for various families F has received a considerable amount of…

We use tools from free probability to study the spectra of Hermitian operators on infinite graphs. Special attention is devoted to universal covering trees of finite graphs. For operators on these graphs we derive a new variational formula…