English
Related papers

Related papers: A version of the Jensen-Johnsbr{\aa}ten coding at …

200 papers

Let $E\supseteq F$ be a field extension and $M$ a graded Lie algebra of maximal class over $E$. We investigate the $F$-subalgebras $L$ of $M$, generated by elements of degree $1$. We provide conditions for $L$ being either ideally…

Rings and Algebras · Mathematics 2023-11-14 Marina Avitabile , Norberto Gavioli , Valerio Monti

Let $X$ be a normed space that satisfies the Johnson-Lindenstrauss lemma (J-L lemma, in short) in the sense that for any integer $n$ and any $x_1,\ldots,x_n\in X$ there exists a linear mapping $L:X\to F$, where $F\subseteq X$ is a linear…

Functional Analysis · Mathematics 2008-07-29 William B. Johnson , Assaf Naor

Shelah has provided sufficient conditions for an $L_{\omega_1, \omega}$-sentence $\psi$ to have arbitrarily large models and for a Morley-like theorem to hold of $\psi$. These conditions involve structural and set-theoretic assumptions on…

Logic · Mathematics 2019-01-25 Marcos Mazari-Armida , Sebastien Vasey

Let $ES_{\ell}(n)$ be the minimum $N$ such that every $N$-element point set in the plane contains either $\ell$ collinear members or $n$ points in convex position. We prove that there is a constant $C>0$ such that, for each $\ell, n \ge 3$,…

Combinatorics · Mathematics 2024-05-07 David Conlon , Jacob Fox , Xiaoyu He , Dhruv Mubayi , Andrew Suk , Jacques Verstraete

Let $a>1$ be an integer. Denote by $l_a(n)$ the multiplicative order of $a$ modulo integer $n\geq 1$. We prove that there is a positive constant $\delta$ such that if $x^{1-\delta}\log^3 x = o(y)$, then $$ \frac1y \sum_{a<y} \frac1x…

Number Theory · Mathematics 2016-05-20 Sungjin Kim

Coding Theory where the alphabet is identified with the elements of a ring or a module has become an important research topic over the last 30 years. Such codes over rings had important applications and many interesting mathematical…

Information Theory · Computer Science 2021-03-17 Niklas Gassner , Marcus Greferath , Joachim Rosenthal , Violetta Weger

H.Furstenberg and E.Glasner proved that for an arbitrary $k\in\mathbb{N}$, any piecewise syndetic set of integers contains a $k$-term arithmetic progression and the collection of such progressions is itself piecewise syndetic in…

Combinatorics · Mathematics 2024-08-22 Dibyendu De , Pintu Debnath

If S is a smooth compact surface in $\mathbb{R}^{3}$ with strictly positive second fundamental form, and $E_S$ is the corresponding extension operator, then we prove that for all $p > 3$, $\left\|E_S f\right\|_{L^p\left(\mathbb{R}^3\right)}…

Classical Analysis and ODEs · Mathematics 2023-04-05 Hoyoung Song

We refine and extend previous constructions of $p$-adic $L$-functions for Rankin-Selberg convolutions on $\GL(n)\times\GL(n-1)$ for regular algebraic representations over totally real fields. We also prove an intrinsic functional equation…

Number Theory · Mathematics 2014-05-05 Fabian Januszewski

By forcing with $\mathbb{P}_{\rm max}$ over strong models of determinacy, we obtain models where different square principles at $\omega_2$ and $\omega_3$ fail. In particular, we obtain a model of $2^{\aleph_0}=2^{\aleph_1}=\aleph_2 +…

We give a general Lagrange multiplier rule for mathematical programming problems in a Hausdorff locally convex space. We consider infinitely many inequality and equality constraints. Our results gives in particular a generalisation of the…

Optimization and Control · Mathematics 2024-02-21 Mohammed Bachir , Joel Blot

The Chen series map giving the universal monodromy representation of $\mathbb{P}^1\backslash\{0,1,\infty\}$ is extended to an injective 1-cocycle of $PSL(2, \mathbb{Z})$ into power series with complex coefficients in two non-commuting…

Number Theory · Mathematics 2019-07-12 Sheldon T Joyner

This paper presents some basic theorems giving the structure of cyclic codes of length n over the ring of integers modulo p^a and over the p-adic numbers, where p is a prime not dividing n. An especially interesting example is the 2-adic…

Combinatorics · Mathematics 2007-07-16 A. R. Calderbank , N. J. A. Sloane

Multiplication is one of the most fundamental computational problems, yet its true complexity remains elusive. The best known upper bound, by F\"{u}rer, shows that two $n$-bit numbers can be multiplied via a boolean circuit of size $O(n \lg…

Data Structures and Algorithms · Computer Science 2019-03-01 Peyman Afshani , Casper Benjamin Freksen , Lior Kamma , Kasper Green Larsen

In \cite{MV} we defined and proved the consistency of the principle ${\rm GM}^+(\omega_3,\omega_1)$ which implies that many consequences of strong forcing axioms hold simultaneously at $\omega_2$ and $\omega_3$. In this paper we formulate a…

Logic · Mathematics 2024-12-30 Rahman Mohammadpour , Boban Velickovic

A graph $G$ is said to be $\mathcal H(n,\Delta)$-universal if it contains every graph on $n$ vertices with maximum degree at most $\Delta$. It is known that for any $\varepsilon > 0$ and any natural number $\Delta$ there exists $c > 0$ such…

Combinatorics · Mathematics 2016-02-02 David Conlon , Asaf Ferber , Rajko Nenadov , Nemanja Škorić

Le Hou\'erou, Patey and Yokoyama defined a parameterized version of $\alpha$-largeness to prove that $\mathsf{WKL}_0 + \mathsf{RT}^2_2$ is a $\forall \Sigma^0_3$-conservative extension of $\mathsf{RCA}_0 + \mathsf{B}\Sigma^0_2$, where…

Logic · Mathematics 2026-02-26 Quentin Le Houérou , Ludovic Patey

We give Woodin's original proof that if there exists a $(\kappa+2)-$strong cardinal $\kappa,$ then there is a generic extension of the universe in which $\kappa=\aleph_\omega,$ $GCH$ holds below $\aleph_\omega$ and…

Logic · Mathematics 2016-01-19 Mohammad Golshani

We propose a generalization of logarithmic and Schwarzenberger bundles over $\P^n=\P^n(\C)$ when the rank is greater than $n$. The first ones are associated to finite sets of points on $\P^{n\vee}$ and the second ones to curves with degree…

Algebraic Geometry · Mathematics 2010-01-05 Jean Vallès

Let $S$ be a dense subring of the real numbers. In this paper we prove a polynomial version of Van der Waerden's theorem near zero. In fact, we prove that if $p_1,\ldots,p_m \in \mathbb{Z}[x]$ are polynomials such that $p_i(0) = 0$ and…

Combinatorics · Mathematics 2025-08-13 Ghadir Ghadimi , Mohammad Akbari Tootkaboni
‹ Prev 1 3 4 5 6 7 10 Next ›