相关论文: Uniquely constructed figures

For each odd $n \geq 3$, we construct a closed convex hypersurface of $\mathbb{R}^{n+1}$ that contains a non-degenerate closed geodesic with Morse index zero. A classical theorem of J. L. Synge would forbid such constructions for even $n$,…

Normally one assumes isolated surface singularities to be normal. The purpose of this paper is to show that it can be useful to look at nonnormal singularities. By deforming them interesting normal singularities can be constructed, such as…

In this paper we study the existence and uniqueness of fixed points of a class of mappings defined on complete, (sequentially compact) cone metric spaces, without continuity conditions and depending on another function.

Given a finite connected bipartite graph, finite-dimensional indecomposable semisimple Leibniz algebras are constructed. Furthermore, any finite-dimensional indecomposable semisimple Leibniz algebra admits a similar construction.

A group $G$ is invariably generated (IG) if there is a subset $S \subseteq G$ such that for every subset $S' \subseteq G$, obtained from $S$ by replacing each element with a conjugate, $S'$ generates $G$. $G$ is finitely invariably…

We discuss the following question: For a function f of two or more variables which is convex in the directions of coordinate axes, how can its trace g(x) = f(x, x, ..., x) look like? In the two-dimensional case, we provide some necessary…

We prove that an open set $D$ in $\C^n$ is pseudoconvex if and only if for any $z\in D$ the largest balanced domain centered at $z$ and contained in $D$ is pseudoconvex, and consider analogues of that characterization in the linearly convex…

Any graph which is not vertex transitive has a proper induced subgraph which is unique due to its structure or the way of its connection to the rest of the graph. We have called such subgraph as an anchor. Using an anchor which, in fact, is…

Convex hexagons that can tile the plane have been classified into three types. For the generic cases (not necessarily convex) of the three types and two other special cases, we classify tilings of the plane under the assumption that all…

In this paper, we prove that a strongly convex complex Finsler metric $F$ on a domain $D\subset\mathbb{C}^n$ is projectively flat (resp. dually flat) if and only if $F$ comes from a strongly convex complex Minkowski metric.

A matching $M$ in a graph $G$ is uniquely restricted if no other matching in $G$ covers the same set of vertices. We conjecture that every connected subcubic graph with $m$ edges and $b$ bridges that is distinct from $K_{3,3}$ has a…

Let S_k be the set of separable states on B(C^m \otimes C^n) admitting a representation as a convex combination of k pure product states, or fewer. If m>1, n> 1, and k \le max(m,n), we show that S_k admits a subset V_k such that V_k is…

We describe a strategy for the construction of finitely generated $G$-equivariant $\mathbb{Z}$-graded modules $M$ over the exterior algebra for a finite group $G$. By an equivariant version of the BGG correspondence, $M$ defines an object…

Proving that a finitely generated convex cone is closed is often considered the most difficult part of geometric proofs of Farkas' lemma. We provide a short simple proof of this fact and (for completeness) derive Farkas' lemma from it using…

We call a (simple) graph G codismantlable if either it has no edges or else it has a codominated vertex x, meaning that the closed neighborhood of x contains that of one of its neighbor, such that G-x codismantlable. We prove that if G is…

Two structures $M, N$ in the same language are called probably isomorphic if they (or, in case of metric structures, their completions) are isomorphic after forcing with the Lebesgue measure algebra. We show that, if $M$ and $N$ are…

A graph $G$ is primarily orientable if it is possible to orient its edges in such a way that the resulting oriented graph is prime, i.e., indecomposable under modular decomposition. We characterize primarily orientable graphs.

Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…

We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…

We give an explicit construction of a closed curve with constant torsion and everywhere positive curvature. We also discuss the restrictions on closed curves of constant torsion when they are constrained to lie on convex surfaces.