Research
Research
Research
Research
31,724+ open-access research outputs.
Denote by $p(k)$ the limit, as $n \rightarrow \infty$, of the probability that a random permutation on a set of size $n$ has an invariant set of size $k$. We give an asymptotic formula for $p(k)$, sho…
In this paper, we prove that if the Frobenius traces agree at all but finitely many places, then two $l$-adic Galois representations, associated to rank-$2$ non-CM Drinfeld modules of generic characte…
We construct a block bootstrap max-test for detecting the presence of significant predictors in a high dimensional setting, allowing for weakly dependent and heterogeneous (possibly non-stationary) da…
Partially ordered patterns (POPs) generalize classical permutation patterns and have been extensively studied in the contexts of permutations, words, compositions, and partitions. Burstein, Han, Kitae…
The reciprocality means a duality in Kirchberg algebras between K-theory groups and strong extension groups. In the paper, we will find a certain class of unital simple Exel--Laca algebras for which t…
Convex maximization encompasses a broad class of optimization problems and is generally NP-hard, even for low-rank objectives. This paper investigates structural conditions under which convex maximiza…
In this article, we first explain a group theoretic interpretation of the derivation of the relation between the flat coordinates of the polynomial prepotential $(H_3)$ and those of the algebraic prep…
In this paper, we prove a big monodromy theorem for the monodromy of cyclic coverings of projective line for cohomology with Fp-coefficients. This is a direct generalization of the results of Achter a…
This paper studies whether solutions of a class of nonlinear feedback systems remain bounded over time. The systems we consider arise naturally in synthetic biology, where the antithetic feedback cont…
The Alternating Direction Method of Multipliers (ADMM) is a widely used method for structured convex optimization, and its practical performance depends strongly on the choice of penalty and relaxatio…
We will generalize the concept of aggregation function for mathematical structures as a certain function between quantales. In fact, these functions turn to be exactly the lax morphism of quantales. T…
Here, we investigate the solutions to equation \[f(f(-x)+x)=f(-f(x))+f(x),\qquad x\in\mathbb{R}\] that are prescribed on the non-positive half-line. We will refer to this prescribed function as the ge…
This paper extends the characterization of compactness established in \cite{cao2024} to bilinear singular integral operators with mild kernel regularity. The exponent we obtain coincides with the best…
This paper presents a method for incorporating control analysis into design optimization for highly-maneuverable aircraft. By studying reachable sets for aircraft dynamics, we ensure that the optimize…
Discrete variational methods show excellent performance in numerical simulations of mechanical systems. In this paper, we adapt discrete variational integrators for the case of mechanical systems with…
Metric-preserving functions (here, metric aggregation functions) offer a natural method for constructing metrics on Cartesian products of metric spaces or for aggregating multiple metrics defined on a…
The planar Tur\'a number of a graph $F$ is the maximum number of edges an $n$-vertex $F$-free planar graph can have. We study the case where $F$ is forbidden as an induced subgraph, thereby introducin…
We prove a criterion for the mildness of a finitely presented pro-$p$ group $G$. It implies as a special case a cohomological mildness criterion via Massey products, generalizing results due to Schmid…
An $n$-tuple $D=(d(1),\dots,d(n))$ is a \emph{feasible degree sequence} if there is a graph on $\{1,\dots,n\}$ such that $i$ has degree $d(i)$. Any such graph will have $m=\sum_{i=1}^n d(i)/2$ edges. …
Our research is closely related to ontological studies in mathematics. It provides crucial insights into the nature of decisions and strategies characterized by Markov moments. In a stopping game, a…
Free open-access publishing with Google Scholar indexing.
Submission Guide →