English
Related papers

Related papers: Fake reflection

200 papers

We show how lattice paths and the reflection principle can be used to give easy proofs of unimodality results. In particular, we give a "one-line" combinatorial proof of the unimodality of the binomial coefficients. Other examples include…

Combinatorics · Mathematics 2007-05-23 Bruce Sagan

Given a quiver, a fixed dimension vector, and a positive integer n, we construct a functor from the category of D-modules on the space of representations of the quiver to the category of modules over a corresponding Gan-Ginzburg algebra of…

Representation Theory · Mathematics 2010-05-18 Silvia Montarani

We extend a result proved in \cite{Col} for mirror symmetries of planar systems to measure-preserving non-linear reversibilities of $n$-dimensional systems, dropping the analyticity and nondegeneracy conditions.

Dynamical Systems · Mathematics 2015-10-07 Marco Sabatini

We formulate a general set of consistency requirements, which are expected to be satisfied by the scattering matrices in the presence of reflecting boundaries. In particular we derive an equivalent to the boostrap equation involving the…

High Energy Physics - Theory · Physics 2011-05-05 A. Fring , R. Köberle

We prove the existence of the reflected diffusion on a complex of an arbitrary size for a large class of planar simple nested fractals. Such a process is obtained as a folding projection of the free Brownian motion from the unbounded…

Probability · Mathematics 2020-01-08 Kamil Kaleta , Mariusz Olszewski , Katarzyna Pietruska-Pałuba

We introduce three families of diagonal reflection principles for matrices of stationary sets of ordinals. We analyze both their relationships among themselves and their relationships with other known principles of simultaneous stationary…

Logic · Mathematics 2023-06-22 Gunter Fuchs , Chris Lambie-Hanson

We give a combinatorial characterization of generic frameworks that are minimally rigid under the additional constraint of maintaining symmetry with respect to a finite order rotation or a reflection. To establish these results we develop a…

Metric Geometry · Mathematics 2015-03-17 Justin Malestein , Louis Theran

We extend Goodwillie's classification of finitary linear functors to arbitrary small functors. That is we show that every small linear simplicial functor from spectra to simplicial sets is weakly equivalent to a filtered colimit of…

Algebraic Topology · Mathematics 2015-10-20 Boris Chorny

We introduce the class of projective reflection groups which includes all complex reflection groups. We show that several aspects involving the combinatorics and the representation theory of all non exceptional irreducible complex…

Combinatorics · Mathematics 2009-02-05 Fabrizio Caselli

In this note we are interested in labelling the irreducible representations of non-semisimple specialisations of Hecke algebras of complex reflection groups. We will use category O for the rational Cherednik algebra and the KZ functor…

Representation Theory · Mathematics 2011-07-19 Maria Chlouveraki , Iain Gordon , Stephen Griffeth

We give a combinatorial characterization of generic minimally rigid reflection frameworks. The main new idea is to study a pair of direction networks on the same graph such that one admits faithful realizations and the other has only…

Geometric Topology · Mathematics 2012-03-13 Justin Malestein , Louis Theran

Canonical extension of finitary ordered structures such as lattices, posets, proximity lattices, etc., is a certain completion which entirely describes the topological dual of the ordered structure and it does so in a purely algebraic and…

Category Theory · Mathematics 2022-05-12 Tomáš Jakl

We study the notion of Wach modules in relative setting, generalizing the arithmetic case. Over an unramified base, for a $p$-adic representation admitting such structure, we examine the relationship between its relative Wach module and…

Number Theory · Mathematics 2025-02-20 Abhinandan

We investigate the asymptotic densities of theorems provable in Zermelo-Fraenkel set theory ZF and its extension ZFC including the axiom of choice. Assuming a canonical De Bruijn representation of formulae, we construct asymptotically large…

Logic · Mathematics 2021-01-26 Maciej Bendkowski

The technique of "classical realizability" is an extension of the method of "forcing"; it permits to extend the Curry-Howard correspondence between proofs and programs, to Zermelo-Fraenkel set theory and to build new models of ZF, called…

Logic in Computer Science · Computer Science 2018-03-20 Jean-Louis Krivine

We explore a framework for complex classical fields, appropriate for describing quantum field theories. Our fields are linear transformations on a Hilbert space, so they are more general than random variables for a probability measure. Our…

Mathematical Physics · Physics 2013-05-07 Arthur Jaffe , Christian D. Jäkel , Roberto E. Martinez

The setting is the representation theory of a simply connected, semisimple algebraic group over a field of positive characteristic. There is a natural transformation from the wall-crossing functor to the identity functor. The kernel of this…

Representation Theory · Mathematics 2010-02-09 Kevin J. Carlin

We introduce and study some variants of a notion of canonical set theoretical truth. By this, we mean truth in a transitive proper class model $M$ of ZFC that is uniquely characterized by some $\in$-formula. We show that there are…

Logic · Mathematics 2026-05-19 Merlin Carl , Philipp Schlicht

This is the second in a series of papers that develops the theory of reflection monoids, motivated by the theory of reflection groups. Reflection monoids were first introduced in arXiv:0812.2789. In this paper we study their presentations…

Group Theory · Mathematics 2013-11-26 Brent Everitt , John Fountain

We theoretically study reflection of light by a phase-conjugating mirror preceded by a partially reflecting normal mirror. The presence of a suitably chosen normal mirror in front of the phase conjugator is found to greatly enhance the…

Optics · Physics 2009-10-31 M. Blaauboer , D. Lenstra , A. Lodder