English
Related papers

Related papers: Minimization of hypersurfaces

200 papers

Let ${\mathbb{F}_{q}}$ be the finite field of order $q$. Let $G$ be one of the three groups ${\rm GL}(n, \mathbb{F}_q)$, ${\rm SL}(n, \mathbb{F}_q)$ or ${\rm U}(n, \mathbb{F}_q)$ and let $W$ be the standard $n$-dimensional representation of…

Commutative Algebra · Mathematics 2017-09-11 Yin Chen , David L. Wehlau

We fix a field $\kk$ of characteristic $p$. For a finite group $G$ denote by $\delta(G)$ and $\sigma(G)$ respectively the minimal number $d$, such that for any finite dimensional representation $V$ of $G$ over $\kk$ and any $v\in…

Commutative Algebra · Mathematics 2014-06-25 Jonathan Elmer , Martin Kohls

We consider the problem of finding the minimizer of a convex function $F: \mathbb R^d \rightarrow \mathbb R$ of the form $F(w) := \sum_{i=1}^n f_i(w) + R(w)$ where a low-rank factorization of $\nabla^2 f_i(w)$ is readily available. We…

Optimization and Control · Mathematics 2016-07-07 Peng Xu , Jiyan Yang , Farbod Roosta-Khorasani , Christopher Ré , Michael W. Mahoney

Let K be a complete, algebraically closed, nonarchimedean valued field, and let f(z) be a rational function in K(z) of degree d at least 2. We show there is a natural way to assign non-negative integer weights w_f(P) to points of the…

Number Theory · Mathematics 2017-06-28 Robert Rumely

Given a graph $F$, let $I(F)$ be the class of graphs containing $F$ as an induced subgraph. Let $W[F]$ denote the minimum $k$ such that $I(F)$ is definable in $k$-variable first-order logic. The recognition problem of $I(F)$, known as…

Computational Complexity · Computer Science 2023-06-22 Oleg Verbitsky , Maksim Zhukovskii

Let $\mathbb{N} \mathcal{A}$ be the monoid generated by $\mathcal{A} = {\mathbf{a}_1, ..., \mathbf{a}_n} \subseteq \mathbb{Z}^d.$ We introduce the homogeneous catenary degree of $\mathbb{N} \mathcal{A}$ as the smallest $N \in \mathbb N$…

Commutative Algebra · Mathematics 2013-10-09 Pedro A. García-Sánchez , Ignacio Ojeda , Alfredo Sánchez-R. -Navarro

Given a positive lower semi-continuous density $f$ on $\mathbb{R}^2$ the weighted volume $V_f:=f\mathscr{L}^2$ is defined on the $\mathscr{L}^2$-measurable sets in $\mathbb{R}^2$. The $f$-weighted perimeter of a set of finite perimeter $E$…

Differential Geometry · Mathematics 2017-09-21 I. McGillivray

Let W be a projective variety of dimension n+1, L a free line bundle on W, X in $H^0(L^d)$ a hypersurface of degree d which is generic among those given by sums of monomials from $L$, and let $f : Y \to X$ be a generically finite map from a…

Algebraic Geometry · Mathematics 2007-05-23 L. Chiantini , A. F. Lopez , Z. Ran

Let $F$ be a homogeneous polynomial of degree $d$ in $m+1$ variables defined over an algebraically closed field of characteristic zero and suppose that $F$ belongs to the $s$-th secant varieties of the standard Veronese variety…

Algebraic Geometry · Mathematics 2012-08-09 Edoardo Ballico , Alessandra Bernardi

Let $\mathcal{F}$ be a family of subsets of a ground set $\{1,\ldots,n\}$ with $|\mathcal{F}|=m$, and let $\mathcal{F}^{\updownarrow}$ denote the family of all subsets of $\{1,\ldots,n\}$ that are subsets or supersets of sets in…

Combinatorics · Mathematics 2023-11-22 Adam Gowty , Daniel Horsley , Adam Mammoliti

We consider cylindrical algebraic decompositions (CADs) as a tool for representing semi-algebraic subsets of $\mathbb{R}^n$. In this framework, a CAD $\mathscr{C}$ is adapted to a given set $S$ if $S$ is a union of cells of $\mathscr{C}$.…

Symbolic Computation · Computer Science 2026-01-15 Lucas Michel , Pierre Mathonet , Naïm Zénaïdi

The submodular partitioning problem asks to minimize, over all partitions $P$ of a ground set $V$, the sum of a given submodular function $f$ over the parts of $P$. The problem has seen considerable work in approximability, as it…

Data Structures and Algorithms · Computer Science 2025-07-03 Kristóf Bérczi , Karthekeyan Chandrasekaran , Tamás Király , Daniel P. Szabo

Given a positive function $F$ on $\mathbb S^n$ which satisfies a convexity condition, for $1\leq r\leq n$, we define for hypersurfaces in $\mathbb{R}^{n+1}$ the $r$-th anisotropic mean curvature function $H_{r; F}$, a generalization of the…

Differential Geometry · Mathematics 2013-06-21 Yijun He

Let $X$ be an irreducible algebraic variety over $\mathbb{C}$, endowed with an algebraic foliation ${\cal{F}}$. In this paper, we introduce the notion of minimal invariant variety $V({\cal{F}},Y)$ with respect to $({\cal{F}},Y)$, where $Y$…

Algebraic Geometry · Mathematics 2007-05-23 Philippe Bonnet

For unweighted graphs, finding isometric embeddings is closely related to decompositions of $G$ into Cartesian products of smaller graphs. When $G$ is isomorphic to a Cartesian graph product, we call the factors of this product a…

Data Structures and Algorithms · Computer Science 2021-12-15 Kristin Sheridan , Joseph Berleant , Mark Bathe , Anne Condon , Virginia Vassilevska Williams

The simplest minimal subtraction method for massive {\lambda}{\phi}4 scalar field theory is presented. We utilize the one-particle irreducible vertex parts framework to deal only with the primitive divergent ones that can be renormalized…

High Energy Physics - Theory · Physics 2023-10-31 Marcelo M. Leite

This article provides a method for constructing invariants and semi-invariants of a binary $N$-ic form over a field $k$ characteristics $0$ or $p > N$. A practical and broadly applicable sufficient condition for ensuring nontriviality of…

Commutative Algebra · Mathematics 2021-04-16 Shashikant Mulay

In this note, we give sufficient conditions for the (semi)stability of a hypersurface $H$ of $\mathbb{P}^N_k$ in terms of its degree $d$, the maximal multiplicity $\delta$ of its singularities, and the dimension $s$ of its singular locus.…

Algebraic Geometry · Mathematics 2024-05-21 Thomas Mordant

We consider the following basic problem: given an $n$-variate degree-$d$ homogeneous polynomial $f$ with real coefficients, compute a unit vector $x \in \mathbb{R}^n$ that maximizes $|f(x)|$. Besides its fundamental nature, this problem…

Data Structures and Algorithms · Computer Science 2017-04-25 Vijay Bhattiprolu , Mrinalkanti Ghosh , Venkatesan Guruswami , Euiwoong Lee , Madhur Tulsiani

Given a graph $F$ and a positive integer $n$, the weak $F$-saturation number $\mathrm{wsat}(K_n,F)$ is the minimum number of edges in a graph $H$ on $n$ vertices such that the edges missing in $H$ can be added, one at a time, so that every…

Combinatorics · Mathematics 2024-06-17 Nikolai Terekhov , Maksim Zhukovskii
‹ Prev 1 2 3 10 Next ›