相关论文: Mallows Permutations and Finite Dependence

An alternative approach for minimum and mode-dependent dwell-time characterization for switched systems is derived. The proposed technique is related to Lyapunov looped-functionals, a new type of functionals leading to stability conditions…

The main aim of the present paper is to introduce new methods for the study of combinatorial designs related to bent functions. They are based on interpretations of convolution on finite abelian groups as multiplication by a…

We characterize which graph invariants are partition functions of an edge-coloring model over the complex numbers, in terms of the rank growth of associated `connection matrices'.

In this paper we introduce the definition of marked permutations. We first present a bijection between Stirling permutations and marked permutations. We then present an involution on Stirling derangements. Furthermore, we present a…

We prove that characteristic equations of certain types of delay differential systems, under some mild conditions on their coefficients, can possess infinitely many complex roots.

The main result provide a common generalization for Ramsey-type theorems concerning finite colorings of edge sets of complete graphs with vertices in infinite semigroups. We capture the essence of theorems proved in different fields: for…

This paper describes a sequence of natural numbers that grows faster than any Turing computable function. This sequence is generated from a version of the tiling problem, called a coloring system. In our proof that generates the sequence,…

We investigate the existence of strong colorings on successors of singular cardinals. This work continues Section 2 of [Sh:413] (math.LO/9809199), but now our emphasis is on finding colorings of pairs of ordinals, rather than colorings of…

In this paper, we study unique colourings in random graphs as a generalization of both conflict-free and injective colourings. Specifically, we impose the condition that a fraction of vertices in the neighbourhood of any vertex are assigned…

In this paper we prove that if $S$ is any finite configuration of points in $\mathbb{Z}^2$, then any finite coloring of $\mathbb{E}^2$ must contain uncountably many monochromatic subsets homothetic to $S$. We extend a result of Brown,…

In the list coloring problem for two matroids, we are given matroids $M_1=(S,{\cal I}_1)$ and $M_2=(S,{\cal I}_2)$ on the same ground set $S$, and the goal is to determine the smallest number $k$ such that given arbitrary lists $L_s$ of $k$…

We prove that, up to adding a complement, every modular representation of a finite group admits a finite resolution by permutation modules.

Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard…

We prove precise stability results for overshoots of Markov additive processes (MAPs) with finite modulating space. Our approach is based on the Markovian nature of overshoots of MAPs whose mixing and ergodic properties are investigated in…

We conclude an investigation of Abrishami, Esperet, Giocanti, Hamman, Knappe and M\"oller studying the existence of periodic colourings of locally finite graphs. A colouring of a graph $\Gamma$ is periodic if the resulting coloured graph…

The finitary isomorphism theorem, due to Keane and Smorodinsky, raised the natural question of how "finite" the isomorphism can be, in terms of moments of the coding radius. More precisely, for which values does there exist an isomorphism…

Construct a random set by independently selecting each finite subset of the integers with some probability depending on the set up to translations and taking the union of the selected sets. We show that when the only sets selected with…

Empirical processes for stationary, causal sequences are considered. We establish empirical central limit theorems for classes of indicators of left half lines, absolutely continuous functions and piecewise differentiable functions. Sample…

We generalize the notion of a coloring complex of a graph to linearized combinatorial Hopf monoids. We determine when a linearized combinatorial Hopf monoid has such a construction, and discover some inequalities that are satisfied by the…

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…