English
Related papers

Related papers: Full reflection of stationary sets below aleph_ome…

200 papers

We determine the solvable complete Lie algebras whose nilradical is isomorphic to a filiform Lie algebra. Moreover we show that for any positive integer $n$ there exists a solvable complete Lie algebras whose second cohomology group with…

Rings and Algebras · Mathematics 2007-05-23 J. M. Ancochea , R. Campoamor

This is a survey of some recent results on the rational circulant covariance extension problem: Given a partial sequence $(c_0,c_1,\dots,c_n)$ of covariance lags $c_k=\mathbb{E}\{y(t+k)\overline{y(t)}\}$ emanating from a stationary periodic…

Statistics Theory · Mathematics 2015-12-18 Anders Lindquist , Giorgio Picci

A non-degenerate second-order maximally conformally superintegrable system in dimension 2 naturally gives rise to a quadric with position dependent coefficients. It is shown how the system's St\"ackel class can be obtained from this…

Exactly Solvable and Integrable Systems · Physics 2021-02-18 Andreas Vollmer

Reflection equation algebras and related U_q(g)-comodule algebras appear in various constructions of quantum homogeneous spaces and can be obtained via transmutation or equivalently via twisting by a cocycle. In this paper we investigate…

Quantum Algebra · Mathematics 2008-12-25 Stefan Kolb , Jasper V. Stokman

Belinskaya's theorem states that given an ergodic measure-preserving transformation, any other transformation with the same orbits and an $\mathrm{L}^1$ cocycle must be flip-conjugate to it. Our main result shows that this theorem is…

Dynamical Systems · Mathematics 2023-07-10 Alessandro Carderi , Matthieu Joseph , François Le Maître , Romain Tessera

It is well-known that the square principle $\square_\lambda$ entails the existence of a non-reflecting stationary subset of $\lambda^+$, whereas the weak square principle $\square^*_\lambda$ does not. Here we show that if…

Logic · Mathematics 2017-11-17 Gunter Fuchs , Assaf Rinot

We deal with the problem of preserving various versions of completeness in (< kappa) --support iterations of forcing notions, generalizing the case ``S --complete proper is preserved by CS iterations for a stationary co-stationary S…

Logic · Mathematics 2016-09-07 Saharon Shelah

In parametric sequence alignment, optimal alignments of two sequences are computed as a function of the penalties for mismatches and spaces, producing many different optimal alignments. Here we give a 3/(2^{7/3}\pi^{2/3})n^{2/3} +O(n^{1/3}…

Genomics · Quantitative Biology 2011-01-19 Cynthia Vinzant

We characterise quasidiagonality of the $C^*$-algebra of a cofinal $k$-graph in terms of an algebraic condition involving the coordinate matrices of the graph. This result covers all simple $k$-graph $C^*$-algebras. In the special case of…

Operator Algebras · Mathematics 2016-05-10 Lisa Orloff Clark , Astrid an Huef , Aidan Sims

We prove that if $\Omega\subset \mathbb R^n$ is a bounded open set and $n\alpha> {\rm dim}_b (\partial \Omega) = d$, then the Brouwer degree deg$(v,\Omega,\cdot)$ of any H\"older function $v\in C^{0,\alpha}\left (\Omega, \mathbb…

Classical Analysis and ODEs · Mathematics 2017-02-08 Camillo De Lellis , Dominik Inauen

In this paper, we investigate the Lie algebra structures of weight one subspaces of $C_2$-cofinite vertex operator superalgebras. We also show that for any positive integer $k$, vertex operator superalgebras $L_{sl(1|n+1)}(k,0)$ and…

Quantum Algebra · Mathematics 2021-01-27 Chunrui Ai , Xingjun Lin

We prove that every $n$-vertex graph with at least $\binom{n}{2} - (n - 4)$ edges has a fractional triangle decomposition, for $n \ge 7$. This is a key ingredient in our proof, given in a companion paper, that every $n$-vertex $2$-coloured…

Combinatorics · Mathematics 2020-08-17 Vytautas Gruslys , Shoham Letzter

Fully oscillating sequences are orthogonal to all topological dynamical systems of quasi-discrete spectrum in the sense of Hahn-Parry. This orthogonality concerns with not only simple but also multiple ergodic means. It is stronger than…

Dynamical Systems · Mathematics 2018-02-15 Ai Hua Fan

We call a family of sets intersecting, if any two sets in the family intersect. In this paper we investigate intersecting families $\mathcal{F}$ of $k$-element subsets of $[n]:=\{1,\ldots, n\},$ such that every element of $[n]$ lies in the…

Combinatorics · Mathematics 2019-07-02 Ferdinand Ihringer , Andrey Kupavskii

We establish the existence of many holomorphic Hecke eigenforms $f$ of large weight $k$ for the full modular group, for which the least positive integer $n_f$ such that $\lambda_f(n_f)<0$ satisfies $n_f \ge (\log k)^{1-o(1)}.$ This is…

Number Theory · Mathematics 2026-02-10 Youness Lamzouri

We compute the homology of the spaces in the Omega spectrum for $BoP$. There is no torsion in $H_*(\underline{BoP}_{\; i})$ for $i \ge 2$, and things are only slightly more complicated for $i < 2$. We find the complete homotopy type of…

Algebraic Topology · Mathematics 2019-05-13 W. Stephen Wilson

For every positive integer $k$, we show that every graph of order $n$ at least $3k$ with more than $$\max\{{2k-1\choose 2}+(2k-1)(n-(2k-1)),{3k-1\choose 2}+(n-(3k-1))\}$$ edges has $k$ vertex disjoint cycles, which is a best possible…

Combinatorics · Mathematics 2014-10-03 Dieter Rautenbach , Bruce Reed

We prove that if $\Omega\subseteq\mathbb{R}^N$ is a set with finite perimeter with $\mathscr{H}^{N-1}(\partial \Omega\setminus\partial^* \Omega)=0$, then any set of finite perimeter $E\subseteq\mathbb{R}^N$ can be approximated by a…

Functional Analysis · Mathematics 2026-03-20 Alessandro Carbotti , Simone Cito , Domenico Angelo La Manna , Aldo Pratelli , Giorgio Stefani

We prove an effective stabilization result for the sheaf cohomology groups of line bundles on flag varieties parametrizing complete flags in k^n, as well as for the sheaf cohomology groups of polynomial functors applied to the cotangent…

Algebraic Geometry · Mathematics 2026-02-10 Claudiu Raicu , Keller VandeBogert

Simon's congruence, denoted \sim_n, relates words having the same subwords of length up to n. We show that, over a k-letter alphabet, the number of words modulo \sim_n is in 2^{\Theta(n^{k-1} log n)}.

Formal Languages and Automata Theory · Computer Science 2016-07-07 Prateek Karandikar , Manfred Kufleitner , Philippe Schnoebelen
‹ Prev 1 8 9 10 Next ›