相关论文: Selection principles and the minimal tower problem

We study periodic tessellations of the Euclidean space with unequal cells arising from the minimization of perimeter functionals. Existence results and qualitative properties of minimizers are discussed for different classes of problems,…

The field of kernelization studies polynomial-time preprocessing routines for hard problems in the framework of parameterized complexity. Although a framework for proving kernelization lower bounds has been discovered in 2008 and…

Using a variational approach, we establish the equivalence between a weighted volume minimization principle and the existence of a conical Calabi-Yau structure on horospherical cones with mild singularities. This allows us to do explicit…

This article begins by deriving a measure-theoretic decomposition of continuous linear functionals on $C(X)$, the space of all real-valued continuous functions on a metric space $(X, d)$, equipped with the topology $\tau_\mathcal{B}$ of…

In this paper we define a notion of calibration for an equivalent approach to the classical Steiner problem in a covering space setting and we give some explicit examples. Moreover we introduce the notion of calibration in families: the…

Topology optimization for general materials is correctly formulated as a bi-level knapsack problem, which is considered to be NP-hard in global optimization and computer science. By using canonical duality theory (CDT) developed by the…

Theories of rough sets and soft sets are powerful mathematical tools for modelling various types of vagueness. Hybrid model combining a rough set with a soft set which is called soft rough set proposed by Feng et al. [3] in 2010. In this…

This paper studies randomized approximation algorithm for a variant of the set cover problem called minimum submodular cost partial multi-cover (SCPMC), in which each element $e$ has a covering requirement $r_e$ and a profit $p_e$, and the…

In a singular potential setting, we generalize a method which allows to show that minimizers under topological constraints of the action functional (or of the Maupertuis') are collision-free. This methods applies to $3$-dimensional problems…

We study the minor relation for algebra homomorphims in finitely generated quasivarieties that admit a logarithmic natural duality. We characterize the minor homomorphism posets of finite algebras in terms of disjoint unions of dual…

The paper studies a general norm minimization problem on a product of normed vector spaces. We establish dual necessary and sufficient optimality conditions and derive explicit formulas for the corresponding solution sets. These formulas…

In part I we reduced the arithmetic (characteristic zero) version of the P \not \subseteq NP conjecture to the problem of showing that a variety associated with the complexity class NP cannot be embedded in the variety associated the…

We study weak solutions to degenerate quasilinear elliptic equations, involving first order terms, in unbounded tubular domains. In particular we show that, under suitable hypotheses, the weak comparison principle holds if the domain is…

In these notes we give a brief introduction to decomposition theory and we summarize some classical and well-known results. The main question is that if a partitioning of a topological space (in other words a decomposition) is given, then…

We consider the problem of quantifying the quality of a model selection problem for a graphical model. We discuss this by formulating the problem as a detection problem. Model selection problems usually minimize a distance between the…

For scale-free networks with degrees following a power law with an exponent $\tau\in(2,3)$, the structures of motifs (small subgraphs) are not yet well understood. We introduce a method designed to identify the dominant structure of any…

Tessellations of $R^3$ that use convex polyhedral cells to fill the space can be extremely complicated, especially if they are not facet-to-facet, that is, if the facets of a cell do not necessarily coincide with the facets of that cell's…

We introduce the concept of a sum-rank saturating system and outline its correspondence to a covering properties of a sum-rank metric code. We consider the problem of determining the shortest sum-rank-$\rho$-saturating systems of a fixed…

Calibrations are a possible tool to validate the minimality of a certain candidate. They have been introduced in the context of minimal surfaces and adapted to the case of Steiner problem in several variants. Our goal is to compare the…

We investigate the sequential topology $\tau_s$ on a complete Boolean algebra $B$ determined by algebraically convergent sequences in $B$. We show the role of weak distributivity of $B$ in separation axioms for the sequential topology. The…