English
Related papers

Related papers: Maximal exponent of the Lorentz cones

200 papers

We show that for every sufficiently large $n$, the number of monotone subsequences of length four in a permutation on $n$ points is at least $\binom{\lfloor n/3 \rfloor}{4} + \binom{\lfloor(n+1)/3\rfloor}{4} + \binom{\lfloor…

Combinatorics · Mathematics 2015-06-03 József Balogh , Ping Hu , Bernard Lidický , Oleg Pikhurko , Balázs Udvari , Jan Volec

We give a general formula for generators of the NL-cone, the cone of effective linear combinations of irreducible components of Noether-Lefschetz divisors, on an orthogonal modular variety. We then fully describe the NL-cone and its…

Algebraic Geometry · Mathematics 2025-11-26 Ignacio Barros , Pietro Beri , Laure Flapan , Brandon Williams

For a given integer $m$ and any residue $a \pmod{m}$ that can be written as a sum of 3 squares modulo $m$, we show the existence of infinitely many integers $n \equiv a \pmod{m}$ such that the number of representations of $n$ as a sum of…

Number Theory · Mathematics 2024-12-04 Michael Filaseta , Jonah Klein , Cihan Sabuncu

Under a geometric assumption on the region near the end of its neck, we prove an optimal exponential lower bound on the widths of resonances for a general two-dimensional Helmholtz resonator. An extension of the result to the n-dimensional…

Analysis of PDEs · Mathematics 2015-02-10 Martinez André , Nédélec Laurence

A necessary condition of the maximally multipartite entangled states (MMES) is given via n-tangle. The condition shows that the n-tangle equal zero for the four-, and eight-qubit of MMESs and the n-tangle equal 1 for two- and six- qubits of…

Quantum Physics · Physics 2014-10-21 Xin-Wei Zha , Jian-Xia Qi , Yun-Guang Zhang

We prove that every connected cubic graph with $n$ vertices has a maximal matching of size at most $\frac{5}{12} n+ \frac{1}{2}$. This confirms the cubic case of a conjecture of Baste, F\"urst, Henning, Mohr and Rautenbach (2019) on regular…

Combinatorics · Mathematics 2021-08-10 Wouter Cames van Batenburg

A square is the concatenation of a nonempty word with itself. A word has period p if its letters at distance p match. The exponent of a nonempty word is the quotient of its length over its smallest period. In this article we give a proof of…

Discrete Mathematics · Computer Science 2012-07-25 Golnaz Badkobeh , Maxime Crochemore

It is proved that for $n \geq 6$, the number of perfect matchings in a simple connected cubic graph on $2n$ vertices is at most $4 f_{n-1}$, with $f_n$ being the $n$-th Fibonacci number. The unique extremal graph is characterized as well.…

Combinatorics · Mathematics 2024-04-01 Peter Horak , Dongryul Kim

For finite-dimensional linear semigroups which leave a proper cone invariant it is shown that irreducibility with respect to the cone implies the existence of an extremal norm. In case the cone is simplicial a similar statement applies to…

Dynamical Systems · Mathematics 2013-06-18 Oliver Mason , Fabian Wirth

For all $n,\phi\in \mathbb{N}$ with $\phi\geqslant n+1$, the smallest possible isoperimetric quotient of an $n$-dimensional convex polytope that has $\phi$ facets is shown to be bounded from above and from below by positive universal…

Metric Geometry · Mathematics 2025-09-18 Keith Ball , Károly J. Böröczky , Assaf Naor

A realization of a deformed Lorentz algebra is considered and its irreducible representations are found; in the limit $q\to 1$, these are precisely the irreducible representations of the classical Lorentz group.

Mathematical Physics · Physics 2009-11-13 B. Aneva

We generalise some well-known graph parameters to operator systems by considering their underlying quantum channels. In particular, we introduce the quantum complexity as the dimension of the smallest co-domain Hilbert space a quantum…

Quantum Physics · Physics 2018-08-22 Rupert H. Levene , Vern I. Paulsen , Ivan G. Todorov

Given any convex $n$-gon, in this article, we: (i) prove that its vertices can form at most $n^2/2 + \Theta(n\log n)$ isosceles trianges with two sides of unit length and show that this bound is optimal in the first order, (ii) conjecture…

Computational Geometry · Computer Science 2010-09-16 Amol Aggarwal

We prove existence of partitions of an open set $\Omega$ with a given number of phases, which minimize the sum of the fractional perimeters of all the phases, with Dirichlet boundary conditions. In two dimensions we show that, if the…

Analysis of PDEs · Mathematics 2020-04-24 Annalisa Cesaroni , Matteo Novaga

We prove an explicit asymptotic formula for the logarithm of the minimal ranks of $n$-universal lattices over the ring of integers of totally real number fields. We also show that, for any constant $C > 0$ and $n \geq 3$, there are only…

Number Theory · Mathematics 2025-10-31 Dayoon Park , Robin Visser , Pavlo Yatsyna , Jongheun Yoon

We prove that the very simple lattices which consist of a largest, a smallest and $2n$ pairwise incomparable elements where $n$ is a positive integer can be realized as the lattices of intermediate subfactors of finite index and finite…

Operator Algebras · Mathematics 2009-05-09 Feng Xu

For a given genus $g \geq 1$, we give lower bounds for the maximal number of rational points on a smooth projective absolutely irreducible curve of genus $g$ over ${\mathbb F}_q$. As a consequence of Katz-Sarnak theory, we first get for any…

Number Theory · Mathematics 2022-05-03 Jonas Bergström , Everett W. Howe , Elisa Lorenzo García , Christophe Ritzenthaler

In this paper we give a simple sequence of necessary and sufficient finite dimensional conditions for a positive map between certain subspaces of bounded linear operators on separable Hilbert spaces to be completely positive. These…

Operator Algebras · Mathematics 2018-07-09 Shmuel Friedland

We prove that the (n-2)-dimensional surface area (perimeter) of central hyperplane sections of the n-dimensional unit cube is maximal for the hyperplane perpendicular to the vector (1,1,0,...,0). This gives a positive answer to a question…

Metric Geometry · Mathematics 2018-06-25 Hermann Koenig , Alexander Koldobsky

We show the applicability of the Cartan decomposition of Lie algebras to quantum circuits. This approach can be used to synthesize circuits that can efficiently implement any desired unitary operation. Our method finds explicit quantum…

‹ Prev 1 4 5 6 7 8 10 Next ›