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

The $k$-symplectic structures appear in the geometric study of the partial differential equations of classical field theories. Meanwhile, we present a new application of the $k$-symplectic structures to investigate a type of systems of…

We count unlabeled k-trees by properly coloring them in k+1 colors and then counting orbits of these colorings under the action of the symmetric group on the colors.

In this paper we provide a fully distributed implementation of the k-means clustering algorithm, intended for wireless sensor networks where each agent is endowed with a possibly high-dimensional observation (e.g., position, humidity,…

In this paper, we present a general wall crossing theory for K-stability and K-moduli of log Fano pairs whose boundary divisors can be non-proportional to the anti-canonical divisor. Along the way, we prove that there are only finitely many…

This note is to indicate the new sphere of applicability of the method developed by Mlak as well as by the author. Restoring those ideas is summoned by current developments concerning $K$-spectral sets on numerical ranges.

We characterize pairs of rational functions $A$, $B$ such that $A$ is semiconjugate to $B$, and $B$ is semiconjugate to $A$.

We prove new estimates of the $K$-divisibility constants for some special Banach couples. In particular, we prove that the $K$-divisibility constant for a couple of the form $(U\oplus V, U)$ where $U$ and $V$ are non-trivial Hilbert spaces…

In this paper we give a first set of communication lower bounds for distributed clustering problems, in particular, for k-center, k-median and k-means. When the input is distributed across a large number of machines and the number of…

We prove several formulas for the distribution of positive roots.

One presents many Concatenated and Operation Sequences, P-Q Relationships, Digital Sequences, Magic Squares, Prime Conjectures, k-Divisibility and Strong Divisibility Sequences, Geometric Conjectures, Proposed problems.

We develop hard clustering based on likelihood rather than distance and prove convergence. We also provide simulations and real data examples.

The notions of $k$-separability and $k$-producibility are useful and expressive tools for the characterization of entanglement in multipartite quantum systems, when a more detailed analysis would be infeasible or simply needless. In this…

Let $\mathbb{K}$ be a field, $R$ be an associative and commutative $\mathbb{K}$-algebra and $L$ be a Lie algebra over $\mathbb{K}$. We give some descriptions of injections from $L$ to Lie algebra of $\mathbb{K}$-derivations of $R$ in the…

We define the characteristic numbers of a holomorphic k-distribution of any dimension on $mathbb P^n$ and obtain relations between these numbers and the characteristic numbers of an invariant subvariety. As an application we bound the…

We derive closed formulas for the number of $k$-coloured partitions and the number of plane partitions of $n$ in terms of the Bell polynomials.

We give new examples of terminal and log canonical singularities.

The $K$-means algorithm is extended to allow for partitioning of skewed groups. Our algorithm is called TiK-Means and contributes a $K$-means type algorithm that assigns observations to groups while estimating their skewness-transformation…

In this paper, we explain how some basic facts about valuation can help clarify many questions about divisibility in integral domains.

For a finite separable field extension K/k, all subfields can be obtained by intersecting so-called principal subfields of K/k. In this work we present a way to quickly compute these intersections. If the number of subfields is high, then…

We describe separating G_2-invariants of several copies of the algebra of octonions over an algebraically closed field of characteristic two. We also obtain a minimal separating and a minimal generating set for G_2-invariants of several…