Related papers: Second order arithmetic means in operator ideals
Resultants and Gr\"obner bases are crucial tools in studying polynomial elimination theory. We investigate relations between the variety of the resultant of two polynomials and the variety of the ideal they generate. Then we focus on the…
In recent years, G\"odel's ontological proof and variations of it were formalized and analyzed with automated tools in various ways. We supplement these analyses with a modeling in an automated environment based on first-order logic…
We show that for a square-free monomial ideal, the regularity of its symbolic (second) power and of the integral closure of of its (second) power can differ from the regularity of its ordinary (second) power by an arbitrarily large integer.
In this paper, we readdress the classical topic of second-order sufficient optimality conditions for optimization problems with nonsmooth structure. Based on the so-called second subderivative of the objective function and of the indicator…
Given a convex optimization problem and its dual, there are many possible first-order algorithms. In this paper, we show the equivalence between mirror descent algorithms and algorithms generalizing the conditional gradient method. This is…
This part of a multi-paper project studies the lattice properties of the arithmetic mean ideals of B(H) introduced by Dykema, Figiel, Weiss, and Wodzicki. We prove: the lattices of all principal ideals, of arithmetic mean or arithmetic mean…
The paper is devoted to obtain first and second order necessary optimality conditions for continuous-time optimization problems with equality and inequality constraints. A full rank type regularity condition along with an uniform implicit…
In this paper we study primality and primary decomposition of certain ideals which are generated by homogeneous degree $2$ polynomials and occur naturally from determinantal conditions. Normality is derived from these results.
We study the ideal generated by polynomials vanishing on a semialgebraic set and propose an algorithm to calculate the generators, which is based on some techniques of the cylindrical algebraic decomposition. By applying these, polynomial…
In this paper we consider nonlinear problems with an operator depending only on the deformation tensor. We consider the class of operators derived from a potential and with $(p,\delta)$ structure, for $1<p\leq 2$ and for all $\delta\geq0$.…
We present two algorithms for computing what we call the absolute factorization of a difference operator. We also give an algorithm to solve third order difference equations in terms of second order equations, together with applications to…
The work of Dykema, Figiel, Weiss, and Wodzicki on the structure of commutators showed that arithmetic means play an important role in the study of operator ideals, and we explored their role in a multipaper project which we survey in this…
The reduction operators, i.e., the operators of nonclassical (conditional) symmetry, of (1+1)-dimensional second order linear parabolic partial differential equations and all the possible reductions of these equations to ordinary…
Families of operator identities appeared as a consequence of an existence of finite-dimensional representation of (super) Lie algebras of first-order differential operators and $q$-deformed (quantum) algebras of first-order…
Let N be a finitely generated module over a Noetherian local ring (R,m). We give criteria for the height of the order ideal N^*(x) of an element x \in N to be bounded by the rank of N. The Generalized Principal Ideal Theorem of Bruns,…
The paper presents two algorithms for finding irreducible decomposition of monomial ideals. The first one is recursive, derived from staircase structures of monomial ideals. This algorithm has a good performance for highly non-generic…
In introductory books about natural numbers, a common kind of assertion - often left as exercise to the reader - is that certain forms of induction on $\mathbb{N}$ (regular/ordinary, complete/strong) are equivalent one to each other and to…
In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…
The notion of singular reduction operators, i.e., of singular operators of nonclassical (conditional) symmetry, of partial differential equations in two independent variables is introduced. All possible reductions of these equations to…
In this paper we establish a hypoellipticity result for second order linear operators comprised by a linear combination, with infinite vanishing coefficients, of subelliptic operators in separate spaces. This generalizes previous known…