Related papers: On K-semistable domains -- more examples

Let K be a field. For a given valuation on K[x], we determine the structure of its graded algebra and describe its set of key polynomials, in terms of any given key polynomial of minimal degree. We also characterize valuations not admitting…

We present new examples of complexes of differential operators of order $k$ (any given positive integer) that satisfy div-curl and/or $L^1$-duality estimates.

We consider the problem of clustering a sample of probability distributions from a random distribution on $\mathbb R^p$. Our proposed partitioning method makes use of a symmetric, positive-definite kernel $k$ and its associated reproducing…

Homology has long been accepted as an important computable tool for quantifying complex structures. In many applications, these structures arise as nodal domains of real-valued functions and are therefore amenable only to a numerical study…

We compare the minimal model of a log canonical pair with the minimal model of its reduced boundary. These results are then used to study the existence of the minimal model of a semi-log-canonical pair using its normalization.

We introduce a logarithmic variant of the notion of $\delta$-rings, which we call $\delta_{\log}$-rings, and use it to define a logarithmic version of the prismatic site introduced by Bhatt and Scholze. In particular, this enables us to…

Let p be a rational prime and let F be a number field. Then, for each i>0, there is a short exact localization sequence for K_{2i}(F). If p is odd or F is nonexceptional, we find necessary and sufficient conditions for this exact sequence…

We establish a version of a semistable reduction theorem over a log point with a non-trivial nilpotent structure. In order to do this we extend the classical desingularization theories to non-reduced schemes with generically principal…

We construct (generalized) logarithmic derivatives for general n-dimensional local fields K of mixed characteristics (0,p) in which p is not necessarily a prime element with residue field k such that [k:k^p]=p^{n-1}. For the construction of…

In this work, two new initialization methods for K-means clustering are proposed. Both proposals are based on applying a divide-and-conquer approach for the K-means|| type of an initialization strategy. The second proposal also utilizes…

Estimates for invariant distances of convexifiable, $\C$-convexifiable and planar domains are given.

Let A be a finitely generated commutative algebra over a field K with a presentation A=K < X_{1}, ..., X_{n} | R >, where R is a set of monomial relations in the generators X_{1}, ..., X_{n}. So A = K[S], the semigroup algebra of the monoid…

Among the novel metrics used to study the relative importance of nodes in complex networks, k-core decomposition has found a number of applications in areas as diverse as sociology, proteinomics, graph visualization, and distributed system…

Clustering algorithms remain valuable tools for grouping and summarizing the most important aspects of data. Example areas where this is the case include image segmentation, dimension reduction, signals analysis, model order reduction,…

We generalize overpartitions to (k,j)-colored partitions: k-colored partitions in which each part size may have at most j colors. We find numerous congruences and other symmetries. We use a wide array of tools to prove our theorems:…

We describe a general methods to localize any sort of k-separability and therefore also the corresponding partial entanglement in genuinely multipartite mixed quantum states. Our methods are based exclusively on the known twopartite methods…

An infinite dimensional algebra, which is useful for deriving exact solutions of the generalized pairing problem, is introduced. A formalism for diagonalizing the corresponding Hamiltonian is also proposed. The theory is illustrated with…

Subsequently to the author's preceding paper, we give full proofs of some explicit formulas about factorizations of $K$-$k$-Schur functions associated with any multiple $k$-rectangles.

Decomposing the domain of a function into parts has many uses in mathematics. A domain may naturally be a union of pieces, a function may be defined by cases, or different boundary conditions may hold on different regions. For any…

We present some properties of the gradient of a mu-differentiable function. The Method of Lagrange Multipliers for mu-differentiable functions is then exemplified.