相关论文: On the weight distribution of linear sets with com…

Assignment of weights to multiple authors of a paper is a challenging task due to its dependence on the conventions that may be different among different fields of research and research groups. In this paper, we describe a scheme for…

We consider the detection and localization of change points in the distribution of an offline sequence of observations. Based on a nonparametric framework that uses a similarity graph among observations, we propose new test statistics when…

We consider the vanishing ideal of an arrangement of linear subspaces in a vector space and investigate when this ideal can be generated by products of linear forms. We introduce a combinatorial construction (blocker duality) which yields…

In this paper we introduce the concept of the rectangular metric like spaces, along with its topology and we prove some fixed point theorems under different contraction principles. We introduce the concept of modified metric-like space as…

We consider the variational inequality problem over the intersection of fixed point sets of firmly nonexpansive operators. In order to solve the problem, we present an algorithm and subsequently show the strong convergence of the generated…

This paper is concerned with the detection of multiple change-points in the joint distribution of independent categorical variables. The procedures introduced rely on model selection and are based on a penalized least-squares criterion.…

We introduce several new constructions of finite posets with the number of linear extensions given by generalized continued fractions. We apply our results to the problem of the minimum number of elements needed for a poset with a given…

We restate a process presented by Stanley as a technique to prove that there exists exactly one $d$-differential distributive lattice for any positive integer $d$. This process can be trivially extended to apply to distributive finitary…

We consider the convergence rate of the alternating projection method for the nontransversal intersection of a semialgebraic set and a linear subspace. For such an intersection, the convergence rate is known as sublinear in the worst case.…

We expand the class of linear symmetric equations for which large sets with no non-trivial solutions are known. Our idea is based on first finding a small set with no solutions and then enlarging it to arbitrary size using a…

Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of $p$-ary linear codes with two or three weights are constructed…

The determination of the weight distribution of linear codes has been a fascinating problem since the very beginning of coding theory. There has been a lot of research on weight enumerators of special cases, such as self-dual codes and…

We consider adjustable robust linear complementarity problems and extend the results of Biefel et al. (2022) towards convex and compact uncertainty sets. Moreover, for the case of polyhedral uncertainty sets, we prove that computing an…

In this paper, we propose a model averaging approach for addressing model uncertainty in the context of partial linear functional additive models. These models are designed to describe the relation between a response and mixed-types of…

Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study binary linear complementary dual $[n,k]$ codes with the largest minimum weight among all binary…

We describe a method for solving linear systems over the localization of a commutative ring $R$ at a multiplicatively closed subset $S$ that works under the following hypotheses: the ring $R$ is coherent, i.e., we can compute finite…

This paper argues that mathematical objects are constructions and that constructions introduce a flexibility in the ways that mathematical objects are represented (as sets of binary sequences for example) and presented (in a particular…

In this article we establish some properties regarding the solutions of a linear congruence, bases of solutions of a linear congruence, and the finding of other solutions starting from these bases.

Following [1], the aim of this paper is to analyze the relative weighted entropy involving the central moments weight functions. We compare the standard relative entropy with the weighted case in two particular forms of Gaussian…

We propose new positive definite kernels for permutations. First we introduce a weighted version of the Kendall kernel, which allows to weight unequally the contributions of different item pairs in the permutations depending on their ranks.…