Zobrazeno 1 - 10
of 714
pro vyhledávání: '"Tang, Chunming"'
This paper is devoted to the classification problems concerning extended deformations of convex polyhedra and real hyperplane arrangements in the following senses: combinatorial equivalence of face posets, normal equivalence on normal fans of convex
Externí odkaz:
http://arxiv.org/abs/2408.03527
In this paper, a restricted memory quasi-Newton bundle method for minimizing a locally Lipschitz function over a Riemannian manifold is proposed, which extends the classical one in Euclidean spaces to the manifold setting. The curvature information o
Externí odkaz:
http://arxiv.org/abs/2402.18308
This paper discusses a class of two-block smooth large-scale optimization problems with both linear equality and linear inequality constraints, which have a wide range of applications, such as economic power dispatch, data mining, signal processing,
Externí odkaz:
http://arxiv.org/abs/2309.14835
Pseudo-geometric designs are combinatorial designs which share the same parameters as a finite geometry design, but which are not isomorphic to that design. As far as we know, many pseudo-geometric designs have been constructed by the methods of fini
Externí odkaz:
http://arxiv.org/abs/2306.10744
In this paper, a descent method for nonsmooth multiobjective optimization problems on complete Riemannian manifolds is proposed. The objective functions are only assumed to be locally Lipschitz continuous instead of convexity used in existing methods
Externí odkaz:
http://arxiv.org/abs/2304.11990
We show that an adjoint of a loopless matroid is connected if and only if it itself is connected. Our first goal is to study the adjoint of modular matroids. We prove that a modular matroid has only one adjoint (up to isomorphism) which can be given
Externí odkaz:
http://arxiv.org/abs/2304.08000
The purpose of this paper is to give explicit constructions of vectorial hyper-bent functions in the $\cP\cS_{ap}^{\#}$ class. It seems that the explicit constructions were so far known only for very special cases. To this end, we present a sufficien
Externí odkaz:
http://arxiv.org/abs/2303.01118
Interplay between coding theory and combinatorial $t$-designs has been a hot topic for many years for combinatorialists and coding theorists. Some infinite families of cyclic codes supporting infinite families of $3$-designs have been constructed in
Externí odkaz:
http://arxiv.org/abs/2207.07262
Autor:
Xiang, Can, Tang, Chunming
Linear codes and $t$-designs are interactive with each other. It is well known that some $t$-designs have been constructed by using certain linear codes in recent years. However, only a small number of infinite families of the extended codes of linea
Externí odkaz:
http://arxiv.org/abs/2206.15153
Autor:
Tang, Chunming, Jia, Feng, Wu, Min, Wang, Yanling, Lu, Xiaowei, Li, Jinyu, Ding, Yan, Chen, Weilin, Chen, Xufeng, Han, Feng, Xu, Huae
Publikováno v:
In Journal of Controlled Release November 2024 375:404-421
