Results 21 to 30 of about 430 (142)
Identifiability of points and rigidity of hypergraphs under algebraic constraints
Abstract The identifiability problem arises naturally in a number of contexts in mathematics and computer science. Specific instances include local or global rigidity of graphs and unique completability of partially‐filled tensors subject to rank conditions.
James Cruickshank +3 more
wiley +1 more source
Abstract We develop a delay‐aware estimation and control framework for a non‐isothermal axial dispersion tubular reactor modelled as a coupled parabolic‐hyperbolic PDE system with recycle‐induced state delay. The infinite‐dimensional dynamics are preserved without spatial discretization by representing the delay as a transport PDE and adopting a late ...
Behrad Moadeli, Stevan Dubljevic
wiley +1 more source
This work investigates the change in optical and electronic properties of monolayer MoS2 through the coupling of its excitons and a plasmonic fractal structure. The formation of the heterostructure shows significant enhancement on the edge of the fractal pattern relative to off, owing to the enhanced electric field at the edge of the branches.
Zeiad Saad +3 more
wiley +1 more source
On the Computation of Tensor Functions under Tensor‐Tensor Multiplications with Linear Maps
ABSTRACT In this paper, we study the computation of both algebraic and non‐algebraic tensor functions under the tensor‐tensor multiplication with linear maps. In the case of algebraic tensor functions, we prove that the asymptotic exponent of both the tensor‐tensor multiplication and the tensor polynomial evaluation problem under this multiplication is
Jeong‐Hoon Ju, Susana López‐Moreno
wiley +1 more source
Enumeration of transversals in the Cayley tables of the non-cyclic groups of order 8
The number of distinct transversals in the Cayley tables of the non-cyclic groups of order 8 is discussed.
David Bedford, Roger M. Whitaker
openaire +3 more sources
On the Foundational Arguments of Sufficient Dimension Reduction
Contemporary Sufficient Dimension Reduction, a versatile method for extracting material information from data, can serve as a preprocessor for classical modeling and inference, or as a standalone theory that leads directly to statistical inference. ABSTRACT Sufficient dimension reduction (SDR) refers to supervised methods of dimension reduction that ...
R. Dennis Cook
wiley +1 more source
An extended definition of Anosov representation for relatively hyperbolic groups
Abstract We define a new family of discrete representations of relatively hyperbolic groups which unifies many existing definitions and examples of geometrically finite behavior in higher rank. The definition includes the relative Anosov representations defined by Kapovich–Leeb and Zhu, and Zhu–Zimmer, as well as holonomy representations of various ...
Theodore Weisman
wiley +1 more source
Let $G$ be a finite abelian group of order $n$ and let $\mathcal M_G=(x_{a+b})_{a,b\in G}$ be the Cayley table of $G$. Let $\text{imm}_λ(\mathcal M_G)$ be the immanant of $\mathcal M_G$ with respect to a partition $λ$ and $\mathcal I_λ(G)$ be the number of formally different monomials occurring in $\text{imm}_λ(\mathcal M_G)$ (in particular, we denote ...
Wang, Xuan, Zhang, Hanbin
openaire +2 more sources
ABSTRACT Binary search trees (BSTs) are fundamental data structures whose performance is largely governed by tree height. We introduce a block model for constructing BSTs by embedding internal BSTs into the nodes of an external BST—a structure motivated by parallel data architectures—corresponding to composite permutations formed via Kronecker or ...
John Peca‐Medlin, Chenyang Zhong
wiley +1 more source
Abstract When conventional supervised machine learning (ML), including decision trees, support vector machines (SVMs), and k‐nearest neighbors (KNN), is applied to geological problems involving complex data sets, it is necessary to select a subset of raw or pre‐processed data types that will be used as input to the ML model.
Limin Xu +2 more
wiley +1 more source

