相关论文: Coloring ordinals by reals

P\'olya's enumeration theorem is concerned with counting labeled sets up to symmetry. Given a finite group acting on a finite set of labeled elements it states that the number of labeled sets up to symmetry is given by a polynomial in the…

A form in a polynomial ring over a field is said to be homaloidal if its polar map is a Cremona map, i.e., if the rational map defined by the partial derivatives of the form has an inverse rational map. The object of this work is the search…

We consider equations involving a combination of local and nonlocal degenerate $p$-Laplace operators. The main contribution of the paper is almost Lipschitz regularity for the homogeneous equation and H\"older continuity with an explicit…

The main focus of this paper is on the problem of relating an ideal $I$ in the polynomial ring $\mathbb Q[x_1, \dots, x_n]$ to a corresponding ideal in $\mathbb F_p[x_1,\dots, x_n]$ where $p$ is a prime number; in other words, the…

We show a model construction for a system of higher-order illative combinatory logic $\mathcal{I}_\omega$, thus establishing its strong consistency. We also use a variant of this construction to provide a complete embedding of first-order…

We generalize the combinatorial principles $C_n(\kappa), C^s_n(\kappa)$ and $Princ(\kappa)$ introduced by various authors, and prove some of their properties and connections between them. We also answer a question asked by Juhasz-Kunen…

We investigate the set of parameters $\kappa\in\C$ for which the singular orbit $(0,e^{\kappa},...)$ of $E_{\kappa}(z):=\exp(z+\kappa)$ converges to $\infty$. These parameters are organized in smooth curves in parameter space called…

A strong coloring on a cardinal $\kappa$ is a function $f:[\kappa]^2\to \kappa$ such that for every $A\subseteq \kappa$ of full size $\kappa$, every color $\gamma<\kappa$ is attained by $f\upharpoonright[A]^2$. The symbol…

Hypergraph $2$-colorability is one of the classical NP-hard problems. Person and Schacht [SODA'09] designed a deterministic algorithm whose expected running time is polynomial over a uniformly chosen $2$-colorable $3$-uniform hypergraph.…

We introduce the logics GLP(\Lambda), a generalization of Japaridze's polymodal provability logic GLP(\omega) where \Lambda is any linearly ordered set representing a hierarchy of provability operators of increasing strength. We shall…

The authors study Hardy spaces, of arbitrary order, on a space of homogeneous type. This extends earlier work that treated only $H^p$ for $p$ near 1. Applications are given to the boundedness of certain singular integral operators,…

A notion of sectional regularity for a homogeneous ideal $I$, which measures the regularity of its generic sections with respect to linear spaces of various dimensions, is introduced. It is related to axial constants defined as the…

From large cardinals we show the consistency of normal, fine, $\kappa$-complete $\lambda$-dense ideals on $\mathcal{P}_\kappa(\lambda)$ for successor $\kappa$. We explore the interplay between dense ideals, cardinal arithmetic, and squares,…

In 1970 Hajnal and Szemer\'edi proved a conjecture of Erd\"os that for a graph with maximum degree $\Delta$, there exists an equitable $\Delta+1$ coloring; that is a coloring where color class sizes differ by at most $1$. In 2007 Kierstand…

We prove that the entropy compression method systematized by L. Esperet and A. Parreau can be applied to any problem formulated in the variable version of the Lovasz Local Lemma. As an application, we prove the existence of legitimate…

This paper explores the operational principles and monomiality principle that significantly shape the development of various special polynomial families. We argue that applying the monomiality principle yields novel results while remaining…

In this paper we study primality and primary decomposition of certain ideals which are generated by homogeneous degree $2$ polynomials and occur naturally from determinantal conditions. Normality is derived from these results.

Inter-coder agreement measures, like Cohen's kappa, correct the relative frequency of agreement between coders to account for agreement which simply occurs by chance. However, in some situations these measures exhibit behavior which make…

Although the P\'olya enumeration theorem has been used extensively for decades, an optimized, purely numerical algorithm for calculating its coefficients is not readily available. We present such an algorithm for finding the number of…

We propose a fast method for high order approximation of potentials of the Helmholtz type operator Delta+kappa^2 over hyper-rectangles in R^n. By using the basis functions introduced in the theory of approximate approximations, the cubature…