Related papers: On algebraic and combinatorial properties of weigh…
The design of complex materials and the formation of specific patterns often arise from the properties of the individual building blocks. In this respect, colloidal systems offer a unique opportunity because nowadays they can be synthesized…
Shellings of simplicial complexes have long been a useful tool in topological and algebraic combinatorics. Shellings of a complex expose a large amount of information in a helpful way, but are not easy to construct, often requiring deep…
Weighing the topological domain over which data can be represented and analysed is a key strategy in many signal processing and machine learning applications, enabling the extraction and exploitation of meaningful data features and their…
This paper proposes convolutional filtering for data whose structure can be modeled by a simplicial complex (SC). SCs are mathematical tools that not only capture pairwise relationships as graphs but account also for higher-order network…
Recently Corteel and Welsh outlined a technique for finding new sum-product identities by using functional relations between generating functions for cylindric partitions and a theorem of Borodin. Here, we extend this framework to include…
The generation of curves and surfaces from given data is a well-known problem in Computer-Aided Design that can be approached using subdivision schemes. They are powerful tools that allow obtaining new data from the initial one by means of…
Persistent homology is a fundamental tool in topological data analysis; however, it lacks methods to quantify the fragility or fineness of cycles, anticipate their formation or disappearance, or evaluate their stability beyond persistence.…
Ehrenborg, Govindaiah, Park, and Readdy recently introduced the van der Waerden complex, a pure simplicial complex whose facets correspond to arithmetic progressions. Using techniques from combinatorial commutative algebra, we classify when…
The paper presents a versatile library of analytic and quasi-analytic complex-valued wavelet packets (WPs) which originate from discrete splines of arbitrary orders. The real parts of the quasi-analytic WPs are the regular spline-based…
This research proposes an effective vertical clustering strategy of 3D data in an elliptical helical shape based on 2D geometry. The clustering object is an elliptical cross-sectioned metal pipe which is been bended in to an elliptical…
This paper studies the topological properties of the World Trade Web (WTW) and its evolution over time by employing a weighted network analysis. We show that the WTW, viewed as a weighted network, displays statistical features that are very…
We study a special class of weakly associative algebras: the symmetric Leibniz algebras. We describe the structure of the commutative and skew symmetric algebras associated with the polarization-depolarization principle. We also give a…
We consider the wreath product of two symmetric groups as a group of blocks permutations and we study its conjugacy classes. We give a polynomiality property for the structure coefficients of the center of the wreath product of symmetric…
A decoding algorithm for polar (sub)codes with binary $2^t\times 2^t$ polarization kernels is presented. It is based on the window processing (WP) method, which exploits the linear relationship of the polarization kernels and the Arikan…
The recent high level of interest in weighted complex networks gives rise to a need to develop new measures and to generalize existing ones to take the weights of links into account. Here we focus on various generalizations of the…
Persistent homology has been studied to better understand the structural properties and topology features of weighted networks. It can reveal hidden layers of information about the higher-order structures formed by non-pairwise interactions…
Weakly-supervised semantic segmentation (WSSS) performs pixel-wise classification given only image-level labels for training. Despite the difficulty of this task, the research community has achieved promising results over the last five…
This paper presents a new approach to non-parametric cluster analysis called Adaptive Weights Clustering (AWC). The idea is to identify the clustering structure by checking at different points and for different scales on departure from…
We propose a weighted common subgraph (WCS) matching algorithm to find the most similar subgraphs in two labeled weighted graphs. WCS matching, as a natural generalization of the equal-sized graph matching or subgraph matching, finds wide…
In image processing tasks, spatial priors are essential for robust computations, regularization, algorithmic design and Bayesian inference. In this paper, we introduce weighted mean curvature (WMC) as a novel image prior and present an…