Related papers: Saturation for product systems of polynomials

We use the minorization-maximization principle (Lange, Hunter and Yang 2000) to establish the monotonicity of a multiplicative algorithm for computing Bayesian D-optimal designs. This proves a conjecture of Dette, Pepelyshev and Zhigljavsky…

In this paper Lowen type multi-fuzzy topological space has been introduced and characterization of topology by its nbd system is studied. Also the product multi-fuzzy topological space has been introduced and it has been investigated that…

We examine the selective screenability property in topological groups. In the metrizable case we also give characterizations in terms of the Haver property and finitary Haver property respectively relative to left-invariant metrics. We…

We consider partial symmetric Toeplitz matrices where a positive definite completion exists. We characterize those patterns where the maximum determinant completion is itself Toeplitz. We then extend these results with positive definite…

Draisma recently proved that polynomial representations of $\mathbf{GL}_{\infty}$ are topologically noetherian. We generalize this result to algebraic representations of infinite rank classical groups.

We study the topology of polynomial functions by deforming them generically. We explain how the non-conservation of the total ``quantity'' of singularity in the neighbourhood of infinity is related to the variation of topology in certain…

We establish various certifying determinantal representation results for a polynomial that contains as a factor a prescribed multivariable polynomials that is strictly stable on a tube domain. The proofs use a Cayley transform in…

All the $F:$N$\rightarrow $C having Ramanujan expansion $F(a)=\sum_{q=1}^{\infty}G(q)c_q(a)$ (here $c_q(a)$ is the Ramanujan sum) pointwise converging in $a\in $N, with $G:$N$\rightarrow $C a multiplicative function, may be factored into…

We study the complexity of representing polynomials as a sum of products of polynomials in few variables. More precisely, we study representations of the form $$P = \sum_{i = 1}^T \prod_{j = 1}^d Q_{ij}$$ such that each $Q_{ij}$ is an…

In the context of data-driven control of nonlinear systems, many approaches lack of rigorous guarantees, call for nonconvex optimization, or require knowledge of a function basis containing the system dynamics. To tackle these drawbacks, we…

It is well-known that when a positively expansive dynamical system is invertible then its underlying space is finite. C.Morales has introduced a decade ago a natural way to generalize positive expansiveness, by introducing other properties…

The fundamental result of Li, Long, and Srinivasan on approximations of set systems has become a key tool across several communities such as learning theory, algorithms, computational geometry, combinatorics and data analysis. The goal of…

Using tools from computable analysis we develop a notion of effectiveness for general dynamical systems as those group actions on arbitrary spaces that contain a computable representative in their topological conjugacy class. Most natural…

We prove that the factorization of a saturated fusion system over a discrete $p$-toral group as a product of indecomposable subsystems is unique up to normal automorphisms of the fusion system and permutations of the factors. In particular,…

For a widely used hub-and-spoke closed product-form network consisting of an infinite-server node and several single-server queues, we characterize the maximum queue-length distribution in various operational regimes by leveraging a novel…

We study complete non-compact manifolds of positive scalar curvature, with a focus on how curvature decay is constrained by topology at infinity. Our first main result shows that topological linking at infinity forces polynomial decay of…

In this short note we prove that a saturated fusion system admitting some special type of automorphism is nilpotent. This generalizes classical results by J.G. Thompson.

Recursive saturation and resplendence are two important notions in models of arithmetic. Kaye, Kossak, and Kotlarski introduced the notion of arithmetic saturation and argued that recursive saturation might not be as rigid as first assumed.…

We introduce an extension of the (tame) polynomial automorphism group over finite fields: the profinite (tame) polynomial automorphism group, which is obtained by putting a natural topology on the automorphism group. We show that most known…

In this paper, we introduce topological entropy for dynamical systems generated by a single local homeomorphism (Deaconu-Renault systems). More precisely, we generalize Adler, Konheim, and McAndrew's definition of entropy via covers and…