相关论文: SPM Bulletin 12

For positive semi-definite block-matrix $M,$ we say that $M$ is P.S.D. and we write $M=\begin{pmatrix} A \& X\\ {X^*} \& B\end{pmatrix} \in {\mathbb{M}}\_{n+m}^+$, with $A\in {\mathbb{M}}\_n^+$, $B \in {\mathbb{M}}\_m^+.$ The focus is on…

We give a self-contained introduction to accessible categories and how they shed light on both model- and set-theoretic questions. We survey for example recent developments on the study of presentability ranks, a notion of cardinality…

The Constraint Satisfaction Problem (CSP) has been intensively studied in many areas of computer science and mathematics. The approach to the CSP based on tools from universal algebra turned out to be the most successful one to study the…

We introduce a problem class we call Polynomial Constraint Satisfaction Problems, or PCSP. Where the usual CSPs from computer science and optimization have real-valued score functions, and partition functions from physics have monomials,…

We continue our study of Sierpinski-type colourings. In contrast to the prequel paper, we focus here on colourings for ideals stratified by their completeness degree. In particular, improving upon Ulam's theorem and its extension by Hajnal,…

The following is an improved version of Chapter 12 of my book [Sm17]. Among others, we present a new unified approach to the Archimedean Positivstellens\"atze for quadratic modules and semirings in Section 12.4 and we add a number of new…

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…

Covering matrices were introduced by Viale in his proof that the Singular Cardinals Hypothesis follows from the Proper Forcing Axiom. In the course of his work and in subsequent work with Sharon, he isolated two reflection principles,…

Contents of Part 2: 11. Supersymmetric Grandunification and Fermion Masses (B. Bajc) 12. General Principles of Brane Kinematics and Dynamics (M. Pavsic) 13. Cosmological Neutrinos (G. Mangano) 14. The Problem of Mass (C.D. Froggatt) 15. How…

After listing basic properties of the Standard Model (SM) that play the crucial role in the field of flavour and CP violation, we discuss the following topics: 1) CKM matrix and the unitarity triangle. 2) Theoretical framework in a…

These notes constitute a survey on the geometric properties of globally subanalytic sets. We start with their definition and some fundamental results such as Gabrielov's Complement Theorem or existence of cell decompositions. We then give…

This is the 30th issue of this bulletin, dedicated to mathematical selection principles and related areas. Now in a concise format.

In this workshop, we discuss several algorithms for mathematical programs with equilibrium constraints (MPECs). The unifying theme is that MPECs are optimization problems whose feasible set contains a lower-level equilibrium system, often…

Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of stability. Examples can be found in areas as diverse as voting theory,…

We introduce a novel field theory representation for the Sum of Powers of Principal Minors (SPPM), a mathematical construct with profound implications in quantum mechanics and statistical physics. We begin by establishing a Berezin integral…

In this paper we present a surprisingly general extension of the main result of a paper that appeared in this journal: I. Montes et al., Sklar's theorem in an imprecise setting, Fuzzy Sets and Systems, 278 (2015), 48--66. The main tools we…

Contents (Part 2): 8.Renormalization of Coupling Constants in the Minimal SUSY Models (R. B. Nevzorov, K. A. Ter-Martirosyan and M. A. Trusov) 9.Multiple Point Model and Phase Transition Couplings ...(L.V. Laperashvili, D.A. Ryzhikh and…

In this paper we study the Product Partition Problem (PPP), i.e. we are given a set of $n$ natural numbers represented on $m$ bits each and we are asked if a subset exists such that the product of the numbers in the subset equals the…

We study robust convex quadratic programs where the uncertain problem parameters can contain both continuous and integer components. Under the natural boundedness assumption on the uncertainty set, we show that the generic problems are…

A convincing feature of least-squares finite element methods is the built-in a posteriori error estimator for any conforming discretization. In order to generalize this property to discontinuous finite element ansatz functions, this paper…