Related papers: On the parameter space of B\"or\"oczky configurati…
One version of the concept of structural controllability defined for single-input systems by Lin and subsequently generalized to multi-input systems by others, states that a parameterized matrix pair $(A, B)$ whose nonzero entries are…
A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…
In this work, we propose an atomic decomposition of the Bergman-Orlicz spaces on the complex upper half-plane. Using this result, we characterize Carleson embeddings with loss between Bergman-Orlicz spaces and certain Orlicz spaces. We also…
The aim of this work is a systematic investigation of the possible parameters of quasi-perfect (QP) binary and ternary linear codes of small dimensions and preparing a complete classification of all such codes. First we give a list of…
A symmetry of the parameter space of interacting boson models IBM-1 and IBM-2 is studied. The symmetry is associated with linear canonical transformations of boson operators, or, equivalently, with the existence of different realizations of…
Many systems in biology, physics and engineering can be described by systems of ordinary differential equation containing many parameters. When studying the dynamic behavior of these large, nonlinear systems, it is useful to identify and…
The parameterized matching problem is a variant of string matching, which is to search for all parameterized occurrences of a pattern $P$ in a text $T$. In considering matching algorithms, the combinatorial natures of strings, especially…
We classify moduli spaces of arrangements of 10 lines with quadruple points. We show that moduli spaces of arrangements of 10 lines with quadruple points may consist of more than 2 disconnected components, namely 3 or 4 distinct points. We…
We study the symbolic and regular powers of ideals I for a family of special configurations of lines in P^3. For this family, we show that I^(m) = I^m for all integers m if and only if I^(3) = I^3. We use these configurations to answer a…
In the note, all indecomposable canonical forms of linear systems with dimension less than or equal to $4$ are determined based on Belitskii's algorithm. As an application, an effective way to calculate dimensions of equivalence classes of…
We consider the most general class of linear boundary-value problems for higher-order ordinary differential systems whose solutions and right-hand sides belong to the corresponding Sobolev spaces. For parameter-dependent problems from this…
A new graph-based order parameter is introduced for the characterization of atomistic structures. The order parameter is universal to any material/chemical system, and is transferable to all structural geometries. Three sets of data are…
We study the problem of crescent configurations, posed by Erd\H{o}s in 1989. A crescent configuration is a set of $n$ points in the plane such that: 1) no three points lie on a common line, 2) no four points lie on a common circle, 3) for…
Inspired by a result by Sz\H{o}ke, we give potential-theoretic characterizations of the dimension of the Bergman space of holomorphic sections of a restriction of a holomorphic line bundle of $\mathbb{P}^1$ to some open set…
We give an almost complete description of the coarse and uniform embeddability between Orlicz sequence spaces. We show that the embeddability between two Orlicz sequence spaces is in most cases determined only by the values of their upper…
An analysis of the boundary representations and C$^*$-envelopes of some finite-dimensional operator systems $\mathcal R$ is undertaken by considering relationships between operator-theoretic properties of a $d$-tuple $\mathfrak…
Pairwise comparisons between alternatives are a well-known method for measuring preferences of a decision-maker. Since these often do not exhibit consistency, a number of inconsistency indices has been introduced in order to measure the…
Compositional generalization, the ability to recognize familiar parts in novel contexts, is a defining property of intelligent systems. Although modern models are trained on massive datasets, they still cover only a tiny fraction of the…
We investigate some types of composition operators, linear and not, and conditions for some spaces to be mapped into themselves and for the operators to satisfy some good properties.
One distinguishing feature of rational curves is that they have algebraic parameterizations. Arc spaces are a way of describing approximations to parameterizations of all curves in some fixed space. Playing on these descriptions, this paper…