يعرض 1 - 10 نتائج من 113 نتيجة بحث عن '"Drescher, C."', وقت الاستعلام: 0.97s تنقيح النتائج
  1. 1
    تقرير

    المؤلفون: Drescher, C., Shepler, A. V.

    الوصف: Lewis, Reiner, and Stanton conjectured a Hilbert seriesfor a space of invariants under an action of finite general linear groups using $(q,t)$-binomial coefficients. This work gives an analog in positive characteristic of theorems relating various Catalan numbers to the representation theory of rational Cherednik algebras. They consider a finite general linear group as a reflection group acting on the quotient of a polynomial ring by iterated powers of the irrelevant ideal under the Frobenius map. We prove a variant of their conjecture in the local case, when the group acting fixes a reflecting hyperplane.
    Comment: 23 pages, includes full stabilizer subgroups for q a prime power

    الوصول الحر: http://arxiv.org/abs/1908.05259Test

  2. 2
    دورية أكاديمية
  3. 3
    مؤتمر
  4. 4
    تقرير

    الوصف: We present X-ray, UV/optical, and radio observations of the stripped-envelope, core-collapse supernova (SN) 2011ei, one of the least luminous SNe IIb or Ib observed to date. Our observations begin with a discovery within 1 day of explosion and span several months afterward. Early optical spectra exhibit broad, Type II-like hydrogen Balmer profiles that subside rapidly and are replaced by Type Ib-like He-rich features on the timescale of one week. High-cadence monitoring of this transition suggests that absorption attributable to a high velocity (> 12,000 km/s) H-rich shell is not rare in Type Ib events. Radio observations imply a shock velocity of v = 0.13c and a progenitor star mass-loss rate of 1.4 x 10^{-5} Msun yr^{-1} (assuming wind velocity v_w=10^3 km/s). This is consistent with independent constraints from deep X-ray observations with Swift-XRT and Chandra. Overall, the multi-wavelength properties of SN 2011ei are consistent with the explosion of a lower-mass (3-4 Msun), compact (R* <= 1x10^{11} cm), He core star. The star retained a thin hydrogen envelope at the time of explosion, and was embedded in an inhomogeneous circumstellar wind suggestive of modest episodic mass-loss. We conclude that SN 2011ei's rapid spectral metamorphosis is indicative of time-dependent classifications that bias estimates of explosion rates for Type IIb and Ib objects, and that important information about a progenitor star's evolutionary state and mass-loss immediately prior to SN explosion can be inferred from timely multi-wavelength observations.
    Comment: 20 pages, 19 figures, accepted for publication in the Astrophysical Journal

    الوصول الحر: http://arxiv.org/abs/1207.2152Test

  5. 5
    دورية أكاديمية
  6. 6
    دورية أكاديمية
  7. 7
  8. 8
    مؤتمر

    الوصف: In this work we present the Partner Units Problem as a novel challenge for optimization methods. It captures a certain type of configuration problem that frequently occurs in industry. Unfortunately, it can be shown that in the most general case an optimization version of the problem is intractable. We present and evaluate encodings of the problem in the frameworks of answer set programming, propositional satisfiability testing, constraint solving, and integer programming. We also show how to adapt these encodings to a class of problem instances that we have recently shown to be tractable.

  9. 9
    مؤتمر

    المؤلفون: Drescher, C

    الوصف: The Partner Units Problem is a challenging combinatorial search problem that originates in the domain of security and surveillance. Technically it consists of partitioning a bipartite graph under side conditions. In this work we describe how constraint programming technology can be leveraged to tackle the problem. We address problem modelling, symmetry breaking and problem-specific search strategies. We introduce the best search strategy known to date as well as a powerful new implied constraint for pruning the search space. Finally, we present implementations in ECLiPSe Prolog and the MINION constraint solver and compare these to a state-of-the-art dedicated algorithm.

  10. 10
    مؤتمر

    المؤلفون: Aschinger, M, Drescher, C, Vollmer, H

    الوصف: LoCo is a fragment of classical first order logic tailored for expressing configuration problems. The core feature of LoCo is that the number of components used in configurations does not have to be finitely bounded explicitly, but instead is bounded implicitly through the axioms. Computing configurations reduces to model-finding. We present the language, related algorithms and complexity results as well as a prototypical implementation via answer set programming.