Related papers: Unbalanced multi-drawing urn with random addition …
We survey some principal results and open problems related to colorings of algebraic and geometric objects endowed with symmetries.
The connection between matrix integrals and links is used to define matrix models which count alternating tangles in which each closed loop is weighted with a factor n, i.e. may be regarded as decorated with n possible colors. For n=2, the…
We consider braids with repeating patterns inside arbitrary knots which provides a multi-parametric family of knots, depending on the "evolution" parameter, which controls the number of repetitions. The dependence of knot (super)polynomials…
We study the existence of the product of two weighted modulation spaces. For this purpose we discuss two different strategies. The more simple one allows transparent proofs in various situations. However, our second method allows a closer…
We study $\ell$-colourings of $(v,k,\lambda)$-BIBDs (balanced incomplete block designs) where, within each block, one colour is absent and each of the $\ell-1$ other colours appears exactly $\frac{k}{\ell-1}$ times. We establish several…
Given a set of n balls each colored with a color, a ball is said to be majority, k-majority, plurality if its color class has size larger than half of the number of balls, has size at least k, has size larger than any other color class;…
We find a combinatorial setting for the coefficients of the Boros-Moll polynomials $P_m(a)$ in terms of partially 2-colored permutations. Using this model, we give a combinatorial proof of a recurrence relation on the coefficients of…
Inference based on the penalized density ratio model is proposed and studied. The model under consideration is specified by assuming that the log--likelihood function of two unknown densities is of some parametric form. The model has been…
We first study superpolynomial associated to triply-graded reduced colored HOMFLY-PT homology. We propose conjectures of congruent relations and cyclotomic expansion for it. We prove conjecture of $N=1$ for torus knot case, through which we…
We study the effects of time and space correlations of an external additive colored noise on the steady-state behavior of a Time-Dependent Ginzburg-Landau model. Simulations show the existence of nonequilibrium phase transitions controlled…
We study range-searching for colored objects, where one has to count (approximately) the number of colors present in a query range. The problems studied mostly involve orthogonal range-searching in two and three dimensions, and the dual…
In a recent paper, Regev and Roichman introduced the <_L order and the L-descent number statistic, des_L, on the group of colored permutations, C_a \wr S_n. Here we define the L-reverse major index statistic, rmaj_L, on the same group and…
This is a treatise on finite point configurations spanning a fixed volume to be found in a single color-class of an arbitrary finite (measurable) coloring of the Euclidean space $\mathbb{R}^n$, or in a single large measurable subset…
In this talk we go over several new developments regarding the techniques for a large class of non-hermitian matrix models with unitary randomness (complex random numbers). In particular, we discuss: (a) - A diagrammatic approach based on a…
In this paper, we study some combinations of the degenerate and incomplete Stirling numbers of the second kind. We use a combinatorial approach and provide some asymptotic results.
Experimental and numerical investigation of single-beam and pump-probe interaction with a resonantly absorbing dense extended medium under strong and weak field-matter coupling is presented. Significant probe beam amplification and conical…
Recently, Hirschhorn and Sellers defined the partition function $a_r(n)$, which counts the number of partitions of $n$ wherein even parts come in only one color, while the odd parts may appear in one of $r$-colors for fixed $r\ge1$. The aim…
In this paper, we consider mixtures of multinomial logistic models (MNL), which are known to $\epsilon$-approximate any random utility model. Despite its long history and broad use, rigorous results are only available for learning a uniform…
Set-coloring a graph means giving each vertex a subset of a fixed color set so that no two adjacent subsets have the same cardinality. When the graph is complete one gets a new distribution problem with an interesting generating function.…
We study the so-called nonconventional averages in the context of lattice spin systems, or equivalently random colourings of the integers. For i.i.d. colourings, we prove a large deviation principle for the number of monochromatic…