Related papers: Non-Numerical Weakly Relational Domains
Submodular set-functions have many applications in combinatorial optimization, as they can be minimized and approximately maximized in polynomial time. A key element in many of the algorithms and analyses is the possibility of extending the…
We give new explicit constructions of several fundamental objects in linear-algebraic pseudorandomness and combinatorics, including lossless rank extractors, weak subspace designs, and strong $s$-blocking sets over finite fields. Our focus…
The dependence of the localization length on the number of occupied subbands $N$ in low-dimensional semiconductors is investigated. The localization length is shown to be proportional to the number of occupied subbands in…
The set of permutations on a finite set can be given the lattice structure known as the weak Bruhat order. This lattice structure is generalized to the set of words on a fixed alphabet $\Sigma$ = {x,y,z,...}, where each letter has a fixed…
Given partitions $\alpha$, $\beta$, $\gamma$, the short exact sequences $0\to N_\alpha \to N_\beta \to N_\gamma \to 0$ of nilpotent linear operators of Jordan types $\alpha$, $\beta$, $\gamma$, respectively, define a constructible subset…
Low-rank model order reduction strategies for contact mechanics show limited dimensionality reduction due to linear inseparability of contact pressure field. Therefore, a dictionary based strategy is explored for creating efficient models…
Nearly convex sets play important roles in convex analysis, optimization and theory of monotone operators. We give a systematic study of nearly convex sets, and construct examples of subdifferentials of lower semicontinuous convex functions…
Axions with broken discrete shift symmetry (axion monodromy) have recently played a central role both in the discussion of inflation and the `relaxion' approach to the hierarchy problem. We suggest a very minimalist way to constrain such…
Boolean functions are important primitives in different domains of cryptology, complexity and coding theory. In this paper, we connect the tools from cryptology and complexity theory in the domain of Boolean functions with low polynomial…
We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive…
This paper discusses and summarizes some results on complex variables that are very useful in fractional-order systems analysis and design, specifically when the system is analyzed in the frequency domain. The author hopes that this…
Nonparametric extension of tensor regression is proposed. Nonlinearity in a high-dimensional tensor space is broken into simple local functions by incorporating low-rank tensor decomposition. Compared to naive nonparametric approaches, our…
Weak sharp minimality is a notion emerged in optimization, whose utility is largeley recognized in the convergence analysis of algorithms for solving extremum problems as well as in the study of the perturbation behaviour of such problems.…
Neighborhood regression has been a successful approach in graphical and structural equation modeling, with applications to learning undirected and directed graphical models. We extend these ideas by defining and studying an algebraic…
We study necessary and sufficient conditions for contraction and incremental stability of dynamical systems with respect to non-Euclidean norms. First, we introduce weak pairings as a framework to study contractivity with respect to…
Neural networks (NNs) have gained significant attention across various engineering disciplines, particularly in design optimization, where they are used to build surrogate models for high-dimensional regression problems. Despite their power…
The probabilistic satisfiability of a logical expression is a fundamental concept known as the partition function in statistical physics and field theory, an evaluation of a related graph's Tutte polynomial in mathematics, and the…
We consider properties of extensions of Krull domains such as flatness that involve behavior of extensions and contractions of prime ideals. Let (R,m) be an excellent normal local domain with field of fractions K, let y be a nonzero element…
We focus on verifying relational properties defined over deep neural networks (DNNs) such as robustness against universal adversarial perturbations (UAP), certified worst-case hamming distance for binary string classifications, etc. Precise…
We consider the lattice of all the weak factorization systems on a given finite lattice. We prove that it is semidistributive, trim and congruence uniform. We deduce a graph theoretical approach to the problem of enumerating transfer…