English
Related papers

Related papers: Level lowering: a Mazur principle in higher dimens…

200 papers

Let $\mathfrak{q}$ denote an $\mathfrak{m}$-primary ideal of a $d$-dimensional local ring $(A, \mathfrak{m}).$ Let $\underline{a} = a_1,\ldots,a_d \subset \mathfrak{q}$ be a system of parameters. Then there is the following inequality for…

Commutative Algebra · Mathematics 2017-02-14 Eduard Boda , Peter Schenzel

We show that if $M^n$ is a properly immersed, two-sided, stable minimal hypersurface in $B^{n+1}_1(0)\setminus S$, where $S$ is closed with $\mathcal{H}^{n-2}(S)=0$, then $\text{dim}_{\mathcal{H}}\text{sing}(M)\leq n-7$, namely…

Differential Geometry · Mathematics 2026-05-07 Paul Minter , Zhengyi Xiao

We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and…

Number Theory · Mathematics 2021-11-10 Borys Kuca

When training deep neural networks for classification tasks, an intriguing empirical phenomenon has been widely observed in the last-layer classifiers and features, where (i) the class means and the last-layer classifiers all collapse to…

Machine Learning · Computer Science 2022-03-15 Jinxin Zhou , Xiao Li , Tianyu Ding , Chong You , Qing Qu , Zhihui Zhu

The problem of determining the optimal minimum degree condition for a balanced bipartite graph on 2ms vertices to contain m vertex disjoint copies of K_{s,s} was solved by Zhao. Later Hladk\'y and Schacht, and Czygrinow and DeBiasio…

Combinatorics · Mathematics 2013-10-03 Andrzej Czygrinow , Louis DeBiasio

The maximum likelihood degree (ML degree) measures the algebraic complexity of a fundamental optimization problem in statistics: maximum likelihood estimation. In this problem, one maximizes the likelihood function over a statistical model.…

Algebraic Geometry · Mathematics 2017-02-13 Jose Israel Rodriguez , Botong Wang

This article makes no claim to originality, other than, perhaps, the simple statement here called the {\it Abstract Maximum Principle}. Actually, the whole contents are strongly based on some H. Sussmann's and coauthors' papers, in which,…

Optimization and Control · Mathematics 2023-10-17 Monica Motta , Franco Rampazzo

We give a necessary and sufficient condition for the Hasse norm principle for field extensions $K/k$ when the Galois groups ${\rm Gal}(L/k)$ of the Galois closure $L/k$ of $K/k$ are isomorphic to the Mathieu group $M_{11}$ of degree $11$ of…

Number Theory · Mathematics 2024-10-01 Akinari Hoshi , Kazuki Kanai , Aiichi Yamasaki

The aim of this note is to give a geometric insight into the classical second order optimality conditions for equality-constrained minimization problem. We show that the Hessian's positivity of the Lagrangian function associated to the…

Optimization and Control · Mathematics 2022-09-13 Luca Amodei

We describe a minimal set of generators of the defining ideal of the Rees Algebra associated to a proper parametrization of any monoid hypersurface. In the case of plane curves, we recover a known description for rational parametrizations…

Commutative Algebra · Mathematics 2010-04-08 Teresa Cortadellas Benitez , Carlos D'Andrea

Let $\mathcal S \subseteq \mathbb Z^m \oplus T$ be a finitely generated and reduced monoid. In this paper we develop a general strategy to study the set of elements in $\mathcal S$ having at least two factorizations of the same length,…

Commutative Algebra · Mathematics 2021-01-15 Evelia R. García Barroso , Ignacio García-Marco , Irene Márquez-Corbella

Let X* be a subset of an affine space A^s, over a finite field K, which is parameterized by the edges of a clutter. Let X and Y be the images of X* under the maps x --> [x] and x --> [(x,1)] respectively, where [x] and [(x,1)] are points in…

Commutative Algebra · Mathematics 2013-06-24 Maria Vaz Pinto , Rafael H. Villarreal

The relationship between the Bayesian approach and the minimum description length approach is established. We sharpen and clarify the general modeling principles MDL and MML, abstracted as the ideal MDL principle and defined from Bayes's…

Machine Learning · Computer Science 2007-07-16 Paul Vitanyi , Ming Li

Let $I$ be a monomial ideal $I$ in a polynomial ring $R = k[x_1,...,x_r]$. In this paper we give an upper bound on $\overline{\dstab} (I)$ in terms of $r$ and the maximal generating degree $d(I)$ of $I$ such that $\depth R/\overline{I^n}$…

Commutative Algebra · Mathematics 2018-09-21 Le Tuan Hoa , Tran Nam Trung

Let $\mathfrak q$ be a Lie algebra over a field $\mathbb K$ and $p,\tilde p\in\mathbb K[t]$ two different normalised polynomials of degree at least 2. As vector spaces both quotient Lie algebras $\mathfrak q[t]/(p)$ and $\mathfrak…

Representation Theory · Mathematics 2021-08-06 Oksana Yakimova

The primary contribution of this thesis is to introduce and examine the planar modular partition monoid for parameters $m, k \in \mathbb{Z}_{>0}$, which has simultaneously and independently generated interest from other researchers as…

Rings and Algebras · Mathematics 2018-08-23 Nicholas Ham

Let q be a prime and -D < -4 be an odd fundamental discriminant such that q splits in Q(\sqrt{-D}). For f a weight zero Hecke-Maass newform of level q and h the weight one theta series of level D corresponding to an ideal class group…

Number Theory · Mathematics 2019-02-20 Sheng-Chi Liu , Riad Masri , Matthew P. Young

Let $(R,\mathfrak{m})$ be a $d$-dimensional Cohen-Macaulay local ring with infinite residue field. Let $I$ be an ideal of $R$ that has analytic spread $\ell(I)=d$, satisfies the $G_d$ condition, the weak Artin-Nagata property $AN_{d-2}^-$…

Commutative Algebra · Mathematics 2017-10-12 Amir Mafi , Dler Naderi

The sup-norm problem in analytic number theory asks for the largest value taken by a given automorphic form. We observe that the function-field version of this problem can be reduced to the geometric problem of finding the largest dimension…

Number Theory · Mathematics 2020-10-28 Will Sawin

Let $\lambda(G)$ be the smallest number of vertices that can be removed from a non-empty graph $G$ so that the resulting graph has a smaller maximum degree. Let $\lambda_{\rm e}(G)$ be the smallest number of edges that can be removed from…

Combinatorics · Mathematics 2020-07-24 Peter Borg