Related papers: Remarks on the Levi core
We present an alternate proof of the passage from the finiteness principle for metric trees to the construction of the core in the C. Fefferman and Shvartsman finiteness theorem for Lipschitz selection problems.
Consider a finite-dimensional, complex Lie algebra G and a semi-simple automorphism {\alpha}. This note aims to give a short and simple proof for explicit upper bounds for the derived length of the radical R and the rank of a Levi…
taking aside the review part, a finite-cardinality's set of new ideas concerning algorithmic information issues in Quantum Mechanics is introduced and analyzed
We give a combinatorial description of shape theory using finite topological $T_0$-spaces (finite partially ordered sets). This description may lead to a sort of computational shape theory. Then we introduce the notion of core for inverse…
Three results in p-convex geometry are established. First is the analogue of the Levi problem in several complex variables, namely: local p-convexity implies global p-convexity. The second asserts that the support of a minimal p-dimensional…
A general structure is developed from which a system of integrable partial difference equations is derived generalising the lattice KdV equation. The construction is based on an infinite matrix scheme with as key ingredient a (formal)…
In this note we consider a question related to the high-dimensional generalization of the classical Severi's finiteness theorem for curves. We will introduce some background and then state the main result. The proof of the main result is…
We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under…
There are several researches on Lie algebras and Lie superalgebras graded by finite root systems. In this paper, we study Leibniz algebras graded by finite root systems and obtain some results in simply-laced cases.
We study a natural generalization of the notion of cores for l-partitions attached with a multi-charge s $\in$ Z^l : the (e, s)-cores. We rely them both to the combinatorics and the notion of weight defined by Fayers. Next we study…
A level orbit of a mechanical Hamiltonian system is a solution of Newton equation that is contained in a level set of the potential energy. In 2003, Mark Levi asked for a characterization of the smooth potential energy functions on the…
Loop Quantum Gravity is widely developed using canonical quantization in an effort to find the correct quantization for gravity. Affine quantization, which is like canonical quantization augmented bounded in one orientation, e.g., a…
A poset is called upper homogeneous, or "upho," if all of its principal order filters are isomorphic to the whole poset. In previous work of the first author, it was shown that each (finite-type N-graded) upho lattice has associated to it a…
We discuss domains of holomorphy and several notions of pseudoconvexity (drawing parallels with the corresponding notions from geometric convexity), and present a mostly self-contained solution to the Levi problem. We restrict our attention…
We give a light introduction to some recent developments in Mori theory, and to our recent direct proof of the finite generation of the canonical ring.
In this short note we introduce a new metric on certain finite groups. It leads to a class of groups for which the element orders satisfy an interesting inequality. This extends the class CP_2 studied in our previous paper [16].
In this paper, we summarize the work on the characterization of finite simple groups and the study on finite groups with the set of element orders and two orders (the order of group and the set of element orders). Some related topics, and…
A new type of local-check additive quantum code is presented. Qubits are associated with edges of a 2-dimensional lattice whereas the stabilizer operators correspond to the faces and the vertices. The boundary of the lattice consists of…
We characterize componentwise linear monomial ideals with minimal Taylor resolution and consider the lower bound for the Betti numbers of componentwise linear ideals.
A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.