Related papers: Reachability in Vector Addition System with States…

We discuss approximability and inapproximability in FPT-time for a large class of subset problems where a feasible solution $S$ is a subset of the input data and the value of $S$ is $|S|$. The class handled encompasses many well-known…

A quantum system's state is identified with a density matrix. Though their probabilistic interpretation is rooted in ensemble theory, density matrices embody a known shortcoming. They do not completely express an ensemble's physical…

Accessibility is essential for designing inclusive urban systems. However, the attempt to capture the complexity of accessibility in a single universal metric has often limited its effective use in design, measurement, and governance across…

We analyze in full-detail the geometric structure of the covariant phase space (CPS) of any local field theory defined over a space-time with boundary. To this end, we introduce a new frame: the "relative bicomplex framework". It is the…

Reachability analysis, in general, is a fundamental method that supports formally-correct synthesis, robust model predictive control, set-based observers, fault detection, invariant computation, and conformance checking, to name but a few.…

Approximate Nearest Neighbor Search (ANNS) plays a critical role in applications such as search engines, recommender systems, and RAG for LLMs. Vector quantization (VQ), a crucial technique for ANNS, is commonly used to reduce space…

This paper proposes an improved variable step-size (VSS) scheme for zero-point attracting projection (ZAP) algorithm. The proposed VSS is proportional to the sparseness difference between filter coefficients and the true impulse response.…

A possible solution to the hierarchy problem is the presence of extra spatial dimensions beyond the three ones which are known from our everyday experience. The phenomenological ADD model of large extra-dimensions predicts a missing…

In real world applications, uncertain parameters are the rule rather than the exception. We present a reachability algorithm for linear systems with uncertain parameters and inputs using set propagation of polynomial zonotopes. In contrast…

The Geometric Bin Packing (GBP) problem is a generalization of Bin Packing where the input is a set of $d$-dimensional rectangles, and the goal is to pack them into unit $d$-dimensional cubes efficiently. It is NP-Hard to obtain a PTAS for…

Given a domain $X$ and a collection $\mathcal{H}$ of functions $h:X\to \{0,1\}$, the Vapnik-Chervonenkis (VC) dimension of $\mathcal{H}$ measures its complexity in an appropriate sense. In particular, the fundamental theorem of statistical…

This paper presents an enhanced direct-method-based approach for the real-time solution of optimal control problems to handle path constraints, such as obstacles. The principal contributions of this work are twofold: first, the existing…

Scalarization method is an important tool in the study of vector optimization as corresponding solutions of vector optimization problems can be found by solving scalar optimization problems. This is applied by Du (2010) [A note on cone…

Reachability analysis is a fundamental problem for safety verification and falsification of Cyber-Physical Systems (CPS) whose dynamics follow physical laws usually represented as differential equations. In the last two decades, numerous…

We study the VC-dimension of the set system on the vertex set of some graph which is induced by the family of its $k$-connected subgraphs. In particular, we give tight upper and lower bounds for the VC-dimension. Moreover, we show that…

This paper introduces a novel reachability problem for the scenario involving two agents, where one agent follows another agent using a feedback strategy. The geometry of the reachable set for an agent, termed \emph{dependent reachable…

The method introduced in (Yehia H M 2006 J. Phys. A: Math. Gen. 39 5807-5824) and (Yehia H M 2012 J. Phys. A: Math. Gen. 45 395209) is extended to construct new families of several-parameter integrable systems, which admit a complementary…

Finite-size scaling (FSS) of the five-dimensional (d=5) Ising model is investigated numerically. Because of the hyperscaling violation in d>4, FSS of the d=5 Ising model no longer obeys the conventional scaling relation. Rather, it is…

We introduce and study the spherical dimension, a natural topological relaxation of the VC dimension that unifies several results in learning theory where topology plays a key role in the proofs. The spherical dimension is defined by…

Weighted geometric set-cover problems arise naturally in several geometric and non-geometric settings (e.g. the breakthrough of Bansal-Pruhs (FOCS 2010) reduces a wide class of machine scheduling problems to weighted geometric set-cover).…