Zobrazeno 1 - 10
of 14 640
pro vyhledávání: '"Partition (number theory)"'
Publikováno v:
Advances in Mathematics of Communications. 17:1210-1234
In this paper, we study the complexity of solving overdetermined generic systems of bilinear polynomials over a finite field \begin{document}$ \mathbb{F} $\end{document} . Given a generic bilinear sequence \begin{document}$ B\in \mathbb{F}[ \textbf{x
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::42d7bd151354b5cf088d9e40e6f2a509
https://doi.org/10.3934/amc.2021047
https://doi.org/10.3934/amc.2021047
Publikováno v:
Discrete Applied Mathematics. 319:149-158
We introduce the notion of m -bonacci-sum graphs denoted by G m , n for positive integers m , n . The vertices of G m , n are 1 , 2 , … , n and any two vertices are adjacent if and only if their sum is an m -bonacci number. We show that G m , n is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::25a5446a88a63b7977be5e269c223d5c
https://doi.org/10.1016/j.dam.2021.02.022
https://doi.org/10.1016/j.dam.2021.02.022
Publikováno v:
Discrete Applied Mathematics. 319:254-270
In an undirected graph, a matching cut is a partition of vertices into two sets such that the edges across the sets induce a matching. The Matching Cut problem is the problem of deciding whether a given graph has a matching cut. Let H be a fixed undi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e0a892d46b12f6615655547aceb33a1
https://doi.org/10.1016/j.dam.2021.05.016
https://doi.org/10.1016/j.dam.2021.05.016
Publikováno v:
Discrete Applied Mathematics. 319:81-91
Given a graph G , we call a partition ( V 1 , V 2 , … , V k ) of its vertex set an induced star partition of G if each set in the partition induces a star. In this paper, we consider the problem of finding an induced star partition of a graph of mi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d36e39a31696d3d0d21d565482d920cf
https://doi.org/10.1016/j.dam.2021.04.015
https://doi.org/10.1016/j.dam.2021.04.015
Publikováno v:
ICDE
Dynamic ridesharing refers to services that arrange one-time shared rides on short notice. It underpins various real-world intelligent transportation applications such as car-pooling, food delivery and last-mile logistics. A core operation in dynamic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a9fb17950f635381246a8a4ed468b24f
https://doi.org/10.1109/tkde.2020.3027200
https://doi.org/10.1109/tkde.2020.3027200
Autor:
Mirko Fiacchini
Publikováno v:
IEEE Transactions on Automatic Control
IEEE Transactions on Automatic Control, Institute of Electrical and Electronics Engineers, In press, ⟨10.1109/TAC.2021.3103872⟩
IEEE Transactions on Automatic Control, Institute of Electrical and Electronics Engineers, In press, ⟨10.1109/TAC.2021.3103872⟩
International audience; This paper presents a computational method to test the stabilizability of discrete-time switched linear systems. The existence of a conic cover of the space on whose elements a convex condition holds is proved to be necessary
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cbdc9a342e181024d60bb604b6647649
https://doi.org/10.1109/tac.2021.3103872
https://doi.org/10.1109/tac.2021.3103872
Publikováno v:
IEEE Transactions on Neural Networks and Learning Systems
—In graph neural networks (GNNs), pooling operators compute local summaries of input graphs to capture their global properties, and they are fundamental for building deep GNNs that learn hierarchical representations. In this work, we propose the No
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::606534095e1e3cee07e363d5fd434c5c
https://doi.org/10.1109/tnnls.2020.3044146
https://doi.org/10.1109/tnnls.2020.3044146
Publikováno v:
ISIT
Let $\mathbf{H}$ be the cartesian product of a family of finite abelian groups indexed by a finite set $\Omega$. A given poset (i.e., partially ordered set) $\mathbf{P}=(\Omega,\preccurlyeq_{\mathbf{P}})$ gives rise to a poset metric on $\mathbf{H}$,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8d510ce68c4b05689ebb00bcc38c78fb
https://doi.org/10.1109/tit.2021.3128630
https://doi.org/10.1109/tit.2021.3128630
Autor:
Erel Segal-Halevi, Elad Aigner-Horev
Publikováno v:
Information Sciences. 587:164-187
A matching in a bipartite graph with parts X and Y is called envy-free if no unmatched vertex in X is a adjacent to a matched vertex in Y. Every perfect matching is envy-free, but envy-free matchings exist even when perfect matchings do not. We prove
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::25c86ab84eca0ede1477238ea832a019
https://doi.org/10.1016/j.ins.2021.11.059
https://doi.org/10.1016/j.ins.2021.11.059
Autor:
Haiyuan Yu, Cunyun Nie
Publikováno v:
Computers & Mathematics with Applications. 105:1-12
We present a monotone finite volume element scheme for the diffusion problem on triangular grids, which stems from some idea about the two-point flux in the literature [15] . A new nonlinear two-point flux formulation is obtained for some part of one
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6f98c5931b69514703e3e98ca7b92d39
https://doi.org/10.1016/j.camwa.2021.11.011
https://doi.org/10.1016/j.camwa.2021.11.011