English
Related papers

Related papers: Computing the tight closure in dimension two

200 papers

A chopped ideal is obtained from a homogeneous ideal by considering only the generators of a fixed degree. We investigate cases in which the chopped ideal defines the same finite set of points as the original one-dimensional ideal. The…

Commutative Algebra · Mathematics 2024-12-05 Fulvio Gesmundo , Leonie Kayser , Simon Telen

We formulate a resolution of singularities algorithm for analyzing the zero sets of real-analytic functions in dimensions $\geq 3$. Rather than using the celebrated result of Hironaka, the algorithm is modeled on a more explicit and…

Classical Analysis and ODEs · Mathematics 2011-08-09 Tristan Collins , Allan Greenleaf , Malabika Pramanik

We show that there is a polynomial-time algorithm with approximation guarantee $\frac{3}{2}+\epsilon$ for the $s$-$t$-path TSP, for any fixed $\epsilon>0$. It is well known that Wolsey's analysis of Christofides' algorithm also works for…

Discrete Mathematics · Computer Science 2019-07-24 Vera Traub , Jens Vygen

A $C^{*}$-algebra $A$ has ideal property if any ideal $I$ of $A$ is generated as a closed two sided ideal by the projections inside the ideal. Suppose that the limit $C^{*}$-algebra $A$ of inductive limit of direct sums of matrix algebras…

Operator Algebras · Mathematics 2017-04-25 Chunlan Jiang

We propose a new efficient algorithm to obtain the locally minimal generating set of the syzygies for an ideal, i.e. a generating set whose proper subsets cannot be generating sets. Syzygy is a concept widely used in the current study of…

High Energy Physics - Theory · Physics 2016-10-03 Gang Chen , Junyu Liu , Ruofei Xie , Hao Zhang , Yehao Zhou

We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in $X$ and $Y$ are low with respect to their genera. The finite base fields $\FF_q$ are arbitrary, but their sizes…

Cryptography and Security · Computer Science 2009-12-20 Andreas Enge , Pierrick Gaudry , Emmanuel Thomé

An implicit purification scheme is proposed for calculation of the temperature-dependent, grand canonical single-particle density matrix, given as a Fermi operator expansion in terms of the Hamiltonian. The computational complexity is shown…

Materials Science · Physics 2009-11-10 Anders M. N. Niklasson

Recently, Yamanaka and Yamashita proposed the so-called positively homogeneous optimization problem, which includes many important problems, such as the absolute-value and the gauge optimizations. They presented a closed form of the dual…

Optimization and Control · Mathematics 2020-12-29 Shota Yamanaka , Nobuo Yamashita

We give sharp lower bounds for the degree of the syzygies involving the partial derivatives of a homogeneous polynomial defining an even dimensional nodal hypersurface. This implies the validity of formulas due to M. Saito, L. Wotzlaw and…

Algebraic Geometry · Mathematics 2019-09-17 Alexandru Dimca

We define a new cutting plane closure for pure integer programs called the two-halfspace closure. It is a natural generalization of the well-known Chv\'atal-Gomory closure. We prove that the two-halfspace closure is polyhedral. We also…

Optimization and Control · Mathematics 2021-08-18 Amitabh Basu , Hongyi Jiang

We obtain a computational realization of the strong approximation theorem. That is, we develop algorithms to compute all congruence quotients modulo rational primes of a finitely generated Zariski dense group $H \leq \mathrm{SL}(n,…

Group Theory · Mathematics 2019-05-08 Alla Detinko , Dane Flannery , Alexander Hulpke

We compute the exact Fourier dimension of the set of $\Psi$-well-approximable $m \times n$ matrices (and the set of $\Psi$-well-approximable numbers) in the homogeneous and inhomogeneous cases for any approximation function $\Psi$…

Number Theory · Mathematics 2024-03-29 Thomas Cai , Kyle Hambrook

Many problems of theoretical and practical interest involve finding a convex or concave function. For instance, optimization problems such as finding the projection on the convex functions in $H^k(\Omega)$, or some problems in economics. In…

Numerical Analysis · Mathematics 2008-04-11 Néstor Aguilera , Pedro Morin

Necessary conditions for high-order optimality in smooth nonlinear constrained optimization are explored and their inherent intricacy discussed. A two-phase minimization algorithm is proposed which can achieve approximate first-, second-…

Optimization and Control · Mathematics 2021-05-31 C. Cartis , N. I. M. Gould , Ph. L. Toint

Let $W/K$ be a nonempty scheme over the field of fractions of a Henselian local ring $R$. A result of Gabber, Liu and Lorenzini shows that the GCD of the set of degrees of closed points on $W$ (which is called the index of $W/K$) can be…

Algebraic Geometry · Mathematics 2023-06-16 Brendan Creutz , Bianca Viray

In this paper, we introduce the notions of tight closure of ideals on Witt rings and quasi-tightly closedness of system of parameters. By using the notions, we obtain a characterization of quasi-$F$-rationality. Furthermore, we study the…

Algebraic Geometry · Mathematics 2024-09-11 Shou Yoshikawa

The jet closure and jet support closure were first introduced by de Fernex, Ein and Ishii to solve the local isomorphism problem. In this paper, we introduce two local algebras associated to jet closure and jet support closure respectively.…

Commutative Algebra · Mathematics 2025-07-09 Yifan Chen , Huaiqing Zuo

This article deals with the numerical approximation of effective coefficients in stochastic homogenization of discrete linear elliptic equations. The originality of this work is the use of a well-known abstract spectral representation…

Probability · Mathematics 2010-08-20 Antoine Gloria , Jean-Christophe Mourrat

It is shown that the singular set for the Yang-Mills flow on unstable holomorphic vector bundles over compact Kaehler manifolds is completely determined by the Harder-Narasimhan-Seshadri filtration of the initial holomorphic bundle. We…

Differential Geometry · Mathematics 2018-10-02 Benjamin Sibley , Richard A. Wentworth

We describe an algorithm for determining the algebraic subgroup of GL(n,C) that is defined as the closure of the group generated by a finite number of elements of GL(n,C). The algorithm avoids the use of Groebner bases and can be used on…

Group Theory · Mathematics 2026-01-12 Willem A. de Graaf
‹ Prev 1 8 9 10 Next ›