382 research outputs found
Conflict-Free Coloring Made Stronger
In FOCS 2002, Even et al. showed that any set of discs in the plane can
be Conflict-Free colored with a total of at most colors. That is,
it can be colored with colors such that for any (covered) point
there is some disc whose color is distinct from all other colors of discs
containing . They also showed that this bound is asymptotically tight. In
this paper we prove the following stronger results:
\begin{enumerate} \item [(i)] Any set of discs in the plane can be
colored with a total of at most colors such that (a) for any
point that is covered by at least discs, there are at least
distinct discs each of which is colored by a color distinct from all other
discs containing and (b) for any point covered by at most discs,
all discs covering are colored distinctively. We call such a coloring a
{\em -Strong Conflict-Free} coloring. We extend this result to pseudo-discs
and arbitrary regions with linear union-complexity.
\item [(ii)] More generally, for families of simple closed Jordan regions
with union-complexity bounded by , we prove that there exists
a -Strong Conflict-Free coloring with at most colors.
\item [(iii)] We prove that any set of axis-parallel rectangles can be
-Strong Conflict-Free colored with at most colors.
\item [(iv)] We provide a general framework for -Strong Conflict-Free
coloring arbitrary hypergraphs. This framework relates the notion of -Strong
Conflict-Free coloring and the recently studied notion of -colorful
coloring. \end{enumerate}
All of our proofs are constructive. That is, there exist polynomial time
algorithms for computing such colorings
The Many Faces of a Character
We prove an identity between three infinite families of polynomials which are
defined in terms of `bosonic', `fermionic', and `one-dimensional configuration'
sums. In the limit where the polynomials become infinite series, they give
different-looking expressions for the characters of the two integrable
representations of the affine algebra at level one. We conjecture yet
another fermionic sum representation for the polynomials which is constructed
directly from the Bethe-Ansatz solution of the Heisenberg spin chain.Comment: 14/9 pages in harvmac, Tel-Aviv preprint TAUP 2125-9
Fusion products, Kostka polynomials, and fermionic characters of su(r+1)_k
Using a form factor approach, we define and compute the character of the
fusion product of rectangular representations of \hat{su}(r+1). This character
decomposes into a sum of characters of irreducible representations, but with
q-dependent coefficients. We identify these coefficients as (generalized)
Kostka polynomials. Using this result, we obtain a formula for the characters
of arbitrary integrable highest-weight representations of \hat{su}(r+1) in
terms of the fermionic characters of the rectangular highest weight
representations.Comment: 21 pages; minor changes, typos correcte
Fermionic solution of the Andrews-Baxter-Forrester model II: proof of Melzer's polynomial identities
We compute the one-dimensional configuration sums of the ABF model using the
fermionic technique introduced in part I of this paper. Combined with the
results of Andrews, Baxter and Forrester, we find proof of polynomial
identities for finitizations of the Virasoro characters
as conjectured by Melzer. In the thermodynamic limit
these identities reproduce Rogers--Ramanujan type identities for the unitary
minimal Virasoro characters, conjectured by the Stony Brook group. We also
present a list of additional Virasoro character identities which follow from
our proof of Melzer's identities and application of Bailey's lemma.Comment: 28 pages, Latex, 7 Postscript figure
Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons
We consider the following motion-planning problem: we are given unit
discs in a simple polygon with vertices, each at their own start position,
and we want to move the discs to a given set of target positions. Contrary
to the standard (labeled) version of the problem, each disc is allowed to be
moved to any target position, as long as in the end every target position is
occupied. We show that this unlabeled version of the problem can be solved in
time, assuming that the start and target positions are at
least some minimal distance from each other. This is in sharp contrast to the
standard (labeled) and more general multi-robot motion-planning problem for
discs moving in a simple polygon, which is known to be strongly NP-hard
Continued Fractions and Fermionic Representations for Characters of M(p,p') minimal models
We present fermionic sum representations of the characters
of the minimal models for all relatively prime
integers for some allowed values of and . Our starting point is
binomial (q-binomial) identities derived from a truncation of the state
counting equations of the XXZ spin chain of anisotropy
. We use the Takahashi-Suzuki method to express
the allowed values of (and ) in terms of the continued fraction
decomposition of (and ) where stands for
the fractional part of These values are, in fact, the dimensions of the
hermitian irreducible representations of (and )
with (and We also establish the duality relation and discuss the action of the Andrews-Bailey transformation in the
space of minimal models. Many new identities of the Rogers-Ramanujan type are
presented.Comment: Several references, one further explicit result and several
discussion remarks adde
Polynomial Identities, Indices, and Duality for the N=1 Superconformal Model SM(2,4\nu)
We prove polynomial identities for the N=1 superconformal model SM(2,4\nu)
which generalize and extend the known Fermi/Bose character identities. Our
proof uses the q-trinomial coefficients of Andrews and Baxter on the bosonic
side and a recently introduced very general method of producing recursion
relations for q-series on the fermionic side. We use these polynomials to
demonstrate a dual relation under q \rightarrow q^{-1} between SM(2,4\nu) and
M(2\nu-1,4\nu). We also introduce a generalization of the Witten index which is
expressible in terms of the Rogers false theta functions.Comment: 41 pages, harvmac, no figures; new identities, proofs and comments
added; misprints eliminate
Spinons in Magnetic Chains of Arbitrary Spins at Finite Temperatures
The thermodynamics of solvable isotropic chains with arbitrary spins is
addressed by the recently developed quantum transfer matrix (QTM) approach. The
set of nonlinear equations which exactly characterize the free energy is
derived by respecting the physical excitations at T=0, spinons and RSOS kinks.
We argue the implication of the present formulation to spinon character formula
of level k=2S SU(2) WZWN model .Comment: 25 pages, 8 Postscript figures, Latex 2e,uses graphicx, added figures
and detailed discussion
Light Induced Increase of Electron Diffusion Length in a p n Junction Type CH3NH3PbBr3 Perovskite Solar Cell
High band gap, high open circuit voltage solar cells with methylammonium lead tribromide MAPbBr3 perovskite absorbers are of interest for spectral splitting and photoelectrochemical applications, because of their good performance and ease of processing. The physical origin of high performance in these and similar perovskite based devices remains only partially understood. Using cross sectional electron beaminduced current EBIC measurements, we find an increase in carrier diffusion length in MAPbBr3 Cl based solar cells upon low intensity a few percent of 1 sun intensity blue laser illumination. Comparing dark and illuminated conditions, the minority carrier electron diffusion length increases about 3.5 times from Ln 100 50 nm to 360 22 nm. The EBIC cross section profile indicates a p amp; 8722;n structure between the n FTO TiO2 and p perovskite, rather than the p amp; 8722;i amp; 8722;n structure, reported for the iodide derivative. On the basis of the variation in space charge region width with varying bias, measured by EBIC and capacitance amp; 8722;voltage measurements, we estimate the net doping concentration in MAPbBr3 Cl to be 3 amp; 8722;6 1017 cm amp; 8722;
The solution of the quantum T-system for arbitrary boundary
We solve the quantum version of the -system by use of quantum
networks. The system is interpreted as a particular set of mutations of a
suitable (infinite-rank) quantum cluster algebra, and Laurent positivity
follows from our solution. As an application we re-derive the corresponding
quantum network solution to the quantum -system and generalize it to
the fully non-commutative case. We give the relation between the quantum
-system and the quantum lattice Liouville equation, which is the quantized
-system.Comment: 24 pages, 18 figure
- âŠ