相关论文: SPM Bulletin 12
In many submodular optimization applications, datasets are naturally partitioned into disjoint subsets. These scenarios give rise to submodular optimization problems with partition-based constraints, where the desired solution set should be…
In this article, a subclass of univalent harmonic mapping is introduced by restricting its analytic part to lie in the class $\mathcal{S}^{\delta}[\alpha]$, $0\leq \alpha < 1$, $-\infty < \delta < \infty$ which has been introduced and…
Sphere packing, Hilbert's eighteenth problem, asks for the densest arrangement of congruent spheres in n-dimensional Euclidean space. Although relevant to areas such as cryptography, crystallography, and medical imaging, the problem remains…
We study parity features as representations that can be evaluated entirely classically once the binary or quantized input representation and parity words are fixed, particularly when labels depend on higher-order feature interactions or…
This paper is concerned with the sample efficiency of reinforcement learning, assuming access to a generative model (or simulator). We first consider $\gamma$-discounted infinite-horizon Markov decision processes (MDPs) with state space…
This research is motivated by the study of the geometry of fractal sets and is focused on uniformization problems: transformation of sets to canonical sets, using maps that preserve the geometry in some sense. More specifically, the main…
In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…
These lecture notes are from a first course on the Minimal Supersymmetric Standard Model. The level of the notes is introductory and pedagogical. Standard Model, basic supersymmetry algebra and its representations are considered as…
This is a written version of lectures delivered at TASI 2022 ``Ten Years After the Higgs Discovery: Particle Physics Now and Future''. Mechanisms and symmetries beyond the Standard Model (BSM) are presented capable of elegantly and robustly…
After a long break, we are back with some very interesting research announcements and an open problem which is one of the most difficult, long lasting, and important problems in the field. A major change in this bulletin is that from now on…
We construct the New Minimal Standard Model that incorporates the new discoveries of physics beyond the Minimal Standard Model (MSM): Dark Energy, non-baryonic Dark Matter, neutrino masses, as well as baryon asymmetry and cosmic inflation,…
The Skolem problem and the related Positivity problem for linear recurrence sequences are outstanding number-theoretic problems whose decidability has been open for many decades. In this paper, the inherent mathematical difficulty of a…
This is the seventh issue of this bulletin, featuring a new form as well as a concise list of past open problems.
We focus on the Sobolev spaces of bounded subanalytic submanifolds of $\mathbb{R}^n$. We prove that if $M$ is such a manifold then the space $\mathscr{C}_0^\infty(M)$ is dense in $W^{1,p}(M,\partial M)$ (the kernel of the trace operator)…
In this paper, we consider a class of structured nonsmooth optimization problems over an embedded submanifold of a Euclidean space, where the first part of the objective is the sum of a difference-of-convex (DC) function and a smooth…
We introduce and study Minimum Cut Representability, a framework to solve optimization and feasibility problems over stable matchings by representing them as minimum s-t cut problems on digraphs over rotations. We provide necessary and…
Submodular function minimization (SFM) is a fundamental and efficiently solvable problem class in combinatorial optimization with a multitude of applications in various fields. Surprisingly, there is only very little known about constraint…
We propose Splinter, a new technique for proving properties of heap-manipulating programs that marries (1) a new separation logic-based analysis for heap reasoning with (2) an interpolation-based technique for refining heap-shape invariants…
This chapter delves into the realm of computational complexity, exploring the world of challenging combinatorial problems and their ties with statistical physics. Our exploration starts by delving deep into the foundations of combinatorial…
Our recent arXiv preprints and published papers on the solution of the Riemann-Lanczos and Weyl-Lanczos problems have brought our attention on the importance of revisiting the algebraic structure of the Bianchi identities in Riemannian…