Tootfinder

The price of clown college is out of control!
https://www.mooseburger.com/product-page/moose-camp-registration-2026

Time appoints Michael Mraz as SVP, Head of Product and Platform AI for "infusing" AI into its product architecture, newsroom workflows, and audience engagement (Time)
https://time.com/7308072/time-appoints-michael-mraz-as-svp-head-of-prod…

TIME Appoints Michael Mraz as SVP, Head of Product and Platform AI
TIME Appoints Michael Mraz as SVP, Head of Product and Platform AI

Cohere hires Joelle Pineau, who previously led Meta's FAIR lab, as chief AI officer, to oversee AI strategy across Cohere's research, product, and policy teams (Maxwell Zeff/TechCrunch)
https://techcrunch.com/2025/08/14/cohe

Cohere hires long-time Meta research head Joelle Pineau as its chief AI officer | TechCrunch
Cohere has hired Joelle Pineau, Meta's former VP of AI research who previously oversaw the tech giant's fundamental AI research (FAIR) lab. In her newly created Chief AI Officer role, Pineau will oversee AI strategy across Cohere's research, product and policy teams.

Falconer's problem for dot product on paraboloids
Chun-Kai Tseng
https://arxiv.org/abs/2509.11710 https://arxiv.org/pdf/2509.11710

Falconer's problem for dot product on paraboloids
We establish dimensional thresholds for dot product sets associated with compact subsets of translated paraboloids. Specifically, we prove that when the dimension of such a subset exceeds $ \frac{5}{4} = \frac{3}{2} - \frac{1}{4} $ in $\mathbb{R}^3$, and $ \frac{d}{2} - \frac{1}{4} - \frac{1}{8d - 4} $ in $\mathbb{R}^d$ for $d\geq 4$, its dot product set has positive Lebesgue measure. This result demonstrates that if a compact set in $ \mathbb{R}^d $ exhibits a paraboloidal structure, then th…

Product idea announcement:
Securing your company's most important digital assets of the 21st century: [productA] transforms your most valued AI prompts into blockchain-secured NFTs.
(Yes, I feel dirty to have come up with such an idea. But I won't be the only one coming up with such 💩, and by posting it I can later tell people "See? ProductB is just plagiarism!". I don't have any plans to make such a product. If your moral code allows you to do it to exploit …

Vor meinem geistigen Auge verschließt er übrigen Roséwein, aber ich glaub er kann auch Apfelsaft.
Handgemalter 30mm #wandklexschmuck auf Flaschenverschluss, ich möchte jemanden grüßen. 😁
(ein oder zwei weitere sind noch mit verschiedenen wählbaren Motiven im Shop auf
https://www.wandklex.art/product/7-12-flaschenverschluss-mit-mehreren-waehlbaren-handgemalten-motiven-174435 zu finden)

Generalized Symmetries and Deformations of Symmetric Product Orbifolds
Nathan Benjamin, Suzanne Bintanja, Yu-Jui Chen, Michael Gutperle, Conghuan Luo, Dikshant Rathore
https://arxiv.org/abs/2509.12180 …

Generalized Symmetries and Deformations of Symmetric Product Orbifolds
We construct generalized symmetries in two-dimensional symmetric product orbifold CFTs $\text{Sym}^N(\mathcal{T}),$ for a generic seed CFT $\mathcal{T}$. These symmetries are more general than the universal and maximally symmetric ones previously constructed. We show that, up to one fine-tuned example when the number of copies $N$ equals four, the only symmetries that can be preserved under twisted sector marginal deformations are invertible and maximally symmetric. The results are obtained in …

product_space: Atlas of Economic Complexity export network
Two networks of economic products, where a pair of products are connected if they are exported at similar rates by the same countries. The data are a projection from a bipartite network of nations and the products they export. Edges weights represent a similarity score (called "proximity"). Data based on UN Comtrade worldwide trade patterns. SITC network based on the Standard International Trade Classification and HS …

Gradient-flowed operator product expansion without IR renormalons
Martin Beneke (TU Munich), Hiromasa Takaura (Kyoto University)
https://arxiv.org/abs/2510.12193 https://…

Gradient-flowed operator product expansion without IR renormalons
A long-standing problem concerns the question how to consistently combine perturbative expansions in QCD with power corrections in the context of the operator product expansion (OPE), since the former exhibit ambiguities due to infrared renormalons, which are of the same order as the power corrections. We propose to use the gradient flow time $1/\sqrt{t}$ as a factorization scale and to express the OPE in terms of IR renormalon-free subtracted perturbative expansions and unambiguous matrix elem…

Cohomological Calibration and Curvature Constraints on Product Manifolds: A Topological Lower Bound
Alexander Pigazzini, Magdalena Toda
https://arxiv.org/abs/2509.11834 https://…

Cohomological Calibration and Curvature Constraints on Product Manifolds: A Topological Lower Bound
We establish a quantitative relationship between mixed cohomology classes and the geometric complexity of cohomologically calibrated metric connections with totally skew torsion on product manifolds. Extending the results of Pigazzini--Toda (2025), we show that the dimension of the off-diagonal curvature subspace of a connection $\nabla^C$ is bounded below by the sum of tensor ranks of the mixed Künneth components of its calibration class. The bound depends only on the mixed class $[ω]_{\math…

A Denotational Product Construction for Temporal Verification of Effectful Higher-Order Programs
Kazuki Watanabe, Mayuko Kori, Taro Sekiyama, Satoshi Kura, Hiroshi Unno
https://arxiv.org/abs/2510.11320

A Denotational Product Construction for Temporal Verification of Effectful Higher-Order Programs
We propose a categorical framework for linear-time temporal verification of effectful higher-order programs, including probabilistic higher-order programs. Our framework provides a generic denotational reduction -- namely, a denotational product construction -- from linear-time safety verification of effectful higher-order programs to computation of weakest pre-conditions of product programs. This reduction enables us to apply existing algorithms for such well-studied computations of weakest pr…

A tensor-based dynamic mode decomposition based on the $\star_{\boldsymbol{M}}$-product
Arvind K. Saibaba, Misha E. Kilmer, Khalil Hall-Hooper, Fan Tian, Alex Mize
https://arxiv.org/abs/2508.10126

A tensor-based dynamic mode decomposition based on the $\star_{\boldsymbol{M}}$-product
Dynamic mode decomposition (DMD) is a data-driven method for estimating the dynamics of a discrete dynamical system. This paper proposes a tensor-based approach to DMD for applications in which the states can be viewed as tensors. Specifically, we use the $\star_{\boldsymbol{M}}$-product framework for tensor decompositions which we demonstrate offers excellent compression compared to matrix-based methods and can be implemented in a computationally efficient manner. We show how the proposed appr…

Maybe weird question, but does anyone have a favorite moving blanket or tarp, ideally one with metal grommets?
I want something that can be tied down with straps when used to cover stuff like furniture on a pickup truck truckbed.
(Please only answer if you have direct experience and have a favorite product.)

On the fully analytical cumulative distribution of product of correlated Gaussian random Variables with zero means
Erdinc Akyildirim, Alper Hekimoglu
https://arxiv.org/abs/2509.09866

On the fully analytical cumulative distribution of product of correlated Gaussian random Variables with zero means
We derive a fully analytical, one-line closed-form expression for the cumulative distribution function (CDF) of the product of two correlated zero-mean normal random variables, avoiding any series representation. This result complements the well-known compact density formula with an equally compact and computationally practical CDF representation. Our main formula expresses the CDF in terms of Humbert's confluent hypergeometric function $Φ_1$ and modified Bessel functions $K_ν$, offering both…

Establishing assembly-oriented modular product architectures through Design for Assembly enhanced Modular Function Deployment
Fabio Marco Monetti, Adam Lundstr\"om, Colin de Kwant, Magnus Gyllenskepp, Antonio Maffei
https://arxiv.org/abs/2510.11089

Establishing assembly-oriented modular product architectures through Design for Assembly enhanced Modular Function Deployment
Modular product design has become a strategic enabler for companies seeking to balance product variety, operational efficiency, and market responsiveness, making the alignment between modular architecture and manufacturing considerations increasingly critical. Modular Function Deployment (MFD) is a widely adopted method for defining modular product architectures, yet it lacks systematic support for assembly considerations during early concept and system-level development. This limitation increa…

The logic of quantum mechanics
Eric Buffenoir
https://arxiv.org/abs/2510.12502 https://arxiv.org/pdf/2510.12502

The logic of quantum mechanics
The quantum logic program originated in a 1936 article by G. Birkhoff and J. von Neumann. This program is generally disregarded due to no-go theorems restricting the existence of the tensor product of elementary quantum logics and, above all, the impossibility of considering entangled states and Bell non-local states within the framework of these composite quantum logics. We revisit this study from the beginning and reverse the perspective. Here, the existence of a tensor product and a star inv…

In June the U.S. Army commissioned four high-level tech executives into the army reserve as lieutenant colonels:
Palantir’s CTO,
Meta’s CTO,
OpenAI’s chief product officer,
and an adviser at Thinking Machines Lab who was formerly OpenAI’s chief research officer
https://infosec.exchange/@…

Embedding the Teacher: Distilling vLLM Preferences for Scalable Image Retrieval
Eric He, Akash Gupta, Adian Liusie, Vatsal Raina, Piotr Molenda, Shirom Chabra, Vyas Raina
https://arxiv.org/abs/2510.12014

Embedding the Teacher: Distilling vLLM Preferences for Scalable Image Retrieval
Text--image retrieval is necessary for applications such as product recommendation. Embedding-based approaches like CLIP enable efficient large-scale retrieval via vector similarity search, but they are primarily trained on literal caption-like text--image pairs and often fail to capture abstract or persona-driven attributes common in product recommendation applications (e.g., ``a gift for a mother who loves gardening''). In contrast, state-of-the-art vision--language models (vLLMs) can align t…

A very stupid workaround (as explained in the article, this has to be done at the factory to make it an officially different product), with the only goal to make it live harder for EV drivers by not offering card payments.
https://www.electrive.com/2025/08/15…

Bypassing the payment terminal with 49.9 kW: TMH sells HYC49 from Alpitronic - electrive.com
The Mobility House offers the Alpitronic Hypercharger HYC49, a fast charger with a maximum charging capacity of 49.9 kW. The model is actually a HYC50, but it

"It's cheaper to buy the default search box everywhere in the world than it is to make a product that is so good that even if we tried another search engine, we'd still prefer Google.
This is enshittification."
From: @…

Cory Doctorow (@pluralistic@mamot.fr)
Angehängt: 1 Bild It's been more than a year since I gave up on Google Search (I switched to Kagi.com and never looked back). I don't miss it. It had gotten terrible. It's gotten worse since, thanks to AI (of course): https://pluralistic.net/2024/04/04/teach-me-how-to-shruggie/#kagi -- If you'd like an essay-formatted version of this thread to read or share, here's a link to it on pluralistic.net, my surveillance-free, ad-free, tracker-free blog: https://pluralistic.net/2025/07/15/inhuman…

Leserbrief:
„Von Prince lernen, heißt siegen lernen. Ich freue mich schon jetzt auf: „The product formerly known as Veggie Burger“ im Kühlregal.“
https://www.taz.de/!6116584
Andererseits könnte die eggiewurst wirklich einfach Hans heißen.

Beyond wreath and block
Michal Botur, Tomasz Kowalski
https://arxiv.org/abs/2509.11610 https://arxiv.org/pdf/2509.11610

Beyond wreath and block
We investigate a semigroup construction generalising the two-sided wreath product. We develop the foundations of this construction and show that for groups it is isomorphic to the usual wreath product. We also show that it gives a slightly finer version of the decomposition in the Krohn-Rhodes Theorem, in which the three-element flip-flop monoid is replaced by the two-element semilattice.

The maximum product of sizes of cross-\(t\)-intersecting families
Jingjun Bao, Lijun Ji
https://arxiv.org/abs/2510.11724 https://arxiv.org/pdf/2510.11724…

The maximum product of sizes of cross-\(t\)-intersecting families
Two families of sets \(\mathcal{A}\) and \(\mathcal{B}\) are called \emph{cross-\(t\)-intersecting} if \(|A \cap B| \geq t\) for all \(A \in \mathcal{A}\) and \(B \in \mathcal{B}\). Determining the maximum product of sizes for such cross-\(t\)-intersecting families is an active problem in extremal set theory. In this paper, we verify the following cross-\(t\)-intersecting version of the Erdős-Ko-Rado theorem: For \(k\geq l \geq t \geq 3\) and \(\min\{m,n\} \geq (t+1)(k-t+1)\), the ma…

An algorithm for the Product-Sum Equality
Hlib Husarov, Eberhard Mayerhofer
https://arxiv.org/abs/2508.09647 https://arxiv.org/pdf/2508.09647

An algorithm for the Product-Sum Equality
We propose a recursive algorithm for identifying all finite sequences of positive integers whose product equals their sum. Our method uses solutions of strictly shorter length that are iteratively extended in pursuit of a valid solution. The algorithm is efficient, with a time complexity similar to the quick sort algorithm.

I am trying out @…, but there are a couple of things that would improve the QoL of the product.
Keyboard shortcuts to open the composer or search box.
And then being able to search for accounts while typing.

The Path-product in Morse Homology with differential graded coefficients
Robin Riegel (IRMA)
https://arxiv.org/abs/2508.09583 https://arxiv.org/pdf/2508.09…

The Path-product in Morse Homology with differential graded coefficients
We will use the tools developed in [Rie24] to give a Morse-theoretic description of a string topology product on the homology of the space of paths in a manifold Y with endpoints in a submanifold X and a module structure on this homology over the Chas-Sullivan ring of Y . These operations have been defined and studied by Stegemeyer in [Ste25] in singular homology.

Imma be rich! Thanks Elon!

SVD-based ugmt-gft on directed product graphs
Guoyun Xie, Zhichao Zhang
https://arxiv.org/abs/2510.10532 https://arxiv.org/pdf/2510.10532

SVD-based ugmt-gft on directed product graphs
Traditional directed graph signal processing generally depends on fixed representation matrices, whose rigid structures limit the model's ability to adapt to complex graph topologies. To address this issue, this study employed the unified graph representation matrix (UGRM) to propose a generalized graph Fourier transform (UGRM-GFT) method based on singular value decomposition (SVD) for signal analysis on directed graphs and Cartesian product graphs. We defined UGRM-GFT for general directed grap…

Types of graded tensor products of graded von Neumann algebras
Jumpei Tanaka
https://arxiv.org/abs/2508.10084 https://arxiv.org/pdf/2508.10084

Types of graded tensor products of graded von Neumann algebras
There is a famous multiplication table of types of tensor product of two von Neumann algebras. We filled out the multiplication table of graded tensor product of two graded von Neumann algebras in special cases.

AppLovin shut down Array last quarter, calling it "a test product" that wasn't "economically viable", after allegations it led to unwanted Android app installs (Bloomberg)
https://www.bloomberg.com/news/articles/20

Color Me Correctly: Bridging Perceptual Color Spaces and Text Embeddings for Improved Diffusion Generation
Sung-Lin Tsai, Bo-Lun Huang, Yu Ting Shen, Cheng Yu Yeo, Chiang Tseng, Bo-Kai Ruan, Wen-Sheng Lien, Hong-Han Shuai
https://arxiv.org/abs/2509.10058

Color Me Correctly: Bridging Perceptual Color Spaces and Text Embeddings for Improved Diffusion Generation
Accurate color alignment in text-to-image (T2I) generation is critical for applications such as fashion, product visualization, and interior design, yet current diffusion models struggle with nuanced and compound color terms (e.g., Tiffany blue, lime green, hot pink), often producing images that are misaligned with human intent. Existing approaches rely on cross-attention manipulation, reference images, or fine-tuning but fail to systematically resolve ambiguous color descriptions. To precisely…

Browns' Quinshon Judkins expected to start in NFL debut, will be on 'pitch count' alongside Dylan Sampson

https://www.cbssports.com/nfl/news/browns…

Berger-Joyal duality and traces I
Nicholas Cecil, Benjamin Cooper
https://arxiv.org/abs/2509.11423 https://arxiv.org/pdf/2509.11423

Berger-Joyal duality and traces I
We give a new proof that the opposite of Joyal's disk category $\mathcal{D}_n$ is Berger's wreath product category $Θ_n = Δ\wr\cdots\wrΔ$. Our techniques continue to apply when the simplex category $Δ$ is replaced by Connes' cyclic category $Λ$ and some other crossed simplicial groups.

Had a great time presenting our paper “Domain-specific tensor languages” today at #ICFP2025 in Singapore 🇸🇬
The images attached are screenshots from the paper as teasers — diagrams for derivative rules, the Riemann curvature 4-tensor in Einstein’s index notation, and the same in diagram form.
📄 Slides:

Crosslisted article(s) found for cs.AI. https://arxiv.org/list/cs.AI/new
[1/6]:
- Personalized Product Search Ranking: A Multi-Task Learning Approach with Tabular and Non-Tabular ...
Morishetti, Kumar, Scott, Nag, Sharma, Vashishtha, Sridhar, Chatter, Achan

User eXperience Perception Insights Dataset (UXPID): Synthetic User Feedback from Public Industrial Forums
Mikhail Kulyabin, Jan Joosten, Choro Ulan uulu, Nuno Miguel Martins Pacheco, Fabian Ries, Filippos Petridis, Jan Bosch, Helena Holmstr\"om Olsson
https://arxiv.org/abs/2509.11777

User eXperience Perception Insights Dataset (UXPID): Synthetic User Feedback from Public Industrial Forums
Customer feedback in industrial forums reflect a rich but underexplored source of insight into real-world product experience. These publicly shared discussions offer an organic view of user expectations, frustrations, and success stories shaped by the specific contexts of use. Yet, harnessing this information for systematic analysis remains challenging due to the unstructured and domain-specific nature of the content. The lack of structure and specialized vocabulary makes it difficult for tradi…

Determining nonlinear balance laws in product-type domains by a single local passive boundary observation
Chaohua Duan, Hongyu Liu, Qingle Meng, Li Wang
https://arxiv.org/abs/2510.10571

Determining nonlinear balance laws in product-type domains by a single local passive boundary observation
This paper introduces an operator-theoretic paradigm for solving inverse problems in nonlinear balance laws, shifting the focus from identifying specific functional forms to recovering the input-output actions of the associated flux and source operators. It is established that a single local passive boundary observation suffices to uniquely determine realizations of these operators for systems posed on product-type domains. This framework, which encompasses dynamical regimes, reveals a holograp…

Abstract String Domain Defined with Word Equations as a Reduced Product (Extended Version)
Antonina Nepeivoda, Ilya Afanasyev
https://arxiv.org/abs/2510.11007 https://

Abstract String Domain Defined with Word Equations as a Reduced Product (Extended Version)
We introduce a string-interval abstract domain, where string intervals are characterized by systems of word equations (encoding lower bounds on string values) and word disequalities (encoding upper bounds). Building upon the lattice structure of string intervals, we define an abstract string object as a reduced product on a string property semilattice, determined by length-non-increasing morphisms. We consider several reduction strategies for abstract string objects and show that upon these str…

Human or Robot? Evidence from Last-Mile Delivery Service
Baorui Li, Xincheng Ma, Brian Rongqing Han, Daizhong Tang, Lei Fu
https://arxiv.org/abs/2509.11562 https://

Human or Robot? Evidence from Last-Mile Delivery Service
As platforms increasingly deploy robots alongside human labor in last-mile logistics, little is known about how contextual features like product attributes, environmental conditions, and psychological mechanisms shape consumer preference in real-world settings. To address this gap, this paper conducts an empirical study on consumer choice between human versus robot service, analyzing 241,517 package-level choices from Alibaba's last-mile delivery stations. We identify how product privacy sensit…

From Pixels to Shelf: End-to-End Algorithmic Control of a Mobile Manipulator for Supermarket Stocking and Fronting
Davide Peron, Victor Nan Fernandez-Ayala, Lukas Segelmark
https://arxiv.org/abs/2509.11740

From Pixels to Shelf: End-to-End Algorithmic Control of a Mobile Manipulator for Supermarket Stocking and Fronting
Autonomous stocking in retail environments, particularly supermarkets, presents challenges due to dynamic human interactions, constrained spaces, and diverse product geometries. This paper introduces an efficient end-to-end robotic system for autonomous shelf stocking and fronting, integrating commercially available hardware with a scalable algorithmic architecture. A major contribution of this work is the system integration of off-the-shelf hardware and ROS2-based perception, planning, and con…

It’s interesting to see Microsoft engineer shitting on Microsoft product on Microsoft dev blog 😂https://devblogs.microsoft.com/oldnewthing/20250915-00/?p=111599

GenAI-Enabled Backlog Grooming in Agile Software Projects: An Empirical Study
Kasper Lien Oftebro, Anh Nguyen-Duc, Kai-Kristian Kemell
https://arxiv.org/abs/2507.10753

GenAI-Enabled Backlog Grooming in Agile Software Projects: An Empirical Study
Effective backlog management is critical for ensuring that development teams remain aligned with evolving requirements and stakeholder expectations. However, as product backlogs consistently grow in scale and complexity, they tend to become cluttered with redundant, outdated, or poorly defined tasks, complicating prioritization and decision making processes. This study investigates whether a generative-AI (GenAI) assistant can automate backlog grooming in Agile software projects without sacrifi…

Silly me! Concerning my previous post about Apple upgrades, I should have mentioned I am referring to the various operating systems, NOT hardware. I certainly do not upgrade every time a new product comes out!
I’m not intending to upgrade either iPhones or Apple Watches this year. #apple

The New York Sun is reviving its print product for the first time since 2008, with weekly editions published in a Berliner format on Fridays (Sara Fischer/Axios)
https://www.axios.com/2025/10/14/new-york-sun-print-edition

Exclusive: The New York Sun revives print edition
Newspapers have rarely revived print editions in an era of declining circulation.

product_space: Atlas of Economic Complexity export network
Two networks of economic products, where a pair of products are connected if they are exported at similar rates by the same countries. The data are a projection from a bipartite network of nations and the products they export. Edges weights represent a similarity score (called "proximity"). Data based on UN Comtrade worldwide trade patterns. SITC network based on the Standard International Trade Classification and HS …

Hausdorff measure of cartesian product of Cantor sets
Siyuan Guo, Taylor Jones
https://arxiv.org/abs/2510.09701 https://arxiv.org/pdf/2510.09701

Hausdorff measure of cartesian product of Cantor sets
Hausdorff measure and Hausdorff dimension are useful tools to describe fractals. This paper investigates the bounds on the $d\log_32$-dimensional Hausdorff measure of the $d$-fold Cartesian product of the $1/3$ Cantor set, $\mathcal C^d$. By applying known theorems on the Hausdorff measure of fractals satisfying the strong open set condition and generalizing what has been done on $\mathcal C^2$, we compute stricter upper and lower bounds for the Hausdorff measure of $\mathcal C^d$ for several s…

Frisch aus Norditalien zurück kann ich übrigens mitteilen, dass der bei der #TazGeno ausgeschenkte #Espresso ausgezeichnet ist. 👌
https://

Looking for a phantomjs alternative, ran a search and ended up on a page with a seemingly good comparison of possibilities, until you realize the page is on zenrows.com domain. I don't think I'll take YOUR word for your product. Not sure what snakeoil they might be selling but feels overtly self-aggrandizing at least

now that I’ve got one to replace my rusty old TS3, you may know that the CalDigit TS5 is back in stock in Europe again: https://shop.caldigit.com/eu/Docking-Stations?product_id=226

Product Of Exponentials (POE) Splines on Lie-Groups: Limitations, Extensions, and Application to SO(3) and SE(3)
Andreas Mueller
https://arxiv.org/abs/2508.10513 https://…

Product Of Exponentials (POE) Splines on Lie-Groups: Limitations, Extensions, and Application to SO(3) and SE(3)
Existing methods for constructing splines and Bezier curves on a Lie group G involve repeated products of exponentials deduced from local geodesics, w.r.t. a Riemannian metric, or rely on general polynomials. Moreover, each of these local curves is supposed to start at the identity of $G$. Both assumptions may not reflect the actual curve to be interpolated. This paper pursues a different approach to construct splines on $G$. Local curves are expressed as solutions of the Poisson equation on G.…

SystolicAttention: Fusing FlashAttention within a Single Systolic Array
Jiawei Lin, Guokai Chen, Yuanlong Li, Thomas Bourgeat
https://arxiv.org/abs/2507.11331

SystolicAttention: Fusing FlashAttention within a Single Systolic Array
Transformer models rely heavily on scaled dot-product attention (SDPA), typically implemented using the FlashAttention algorithm. However, current systolic-array-based accelerators face significant challenges when executing FlashAttention. Systolic arrays can only achieve high utilization for consecutive and large matrix multiplications. In contrast, FlashAttention requires frequently interleaved matrix multiplications and softmax operations. The frequent data swaps between the systolic array…

Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Abstract String Domain Defined with Word Equations as a Reduced Product (Extended Version)
Antonina Nepeivoda, Ilya Afanasyev

New complexity bounds for primal--dual interior-point algorithms in conic optimization
Joachim Dahl, Levent Tun\c{c}el, Lieven Vandenberghe
https://arxiv.org/abs/2509.10263 http…

New complexity bounds for primal--dual interior-point algorithms in conic optimization
We provide improved complexity results for symmetric primal--dual interior-point algorithms in conic optimization. The results follow from new uniform bounds on a key complexity measure for primal--dual metrics at pairs of primal and dual points. The complexity measure is defined as the largest eigenvalue of the product of the Hessians of the primal and dual barrier functions, normalized by the proximity of the points to the central path. For algorithms based on self-scaled barriers for symmetr…

Active Sequential Hypothesis Testing with Non-Homogeneous Costs
George Vershinin, Asaf Cohen, Omer Gurewitz
https://arxiv.org/abs/2509.11632 https://arxiv.…

Active Sequential Hypothesis Testing with Non-Homogeneous Costs
We study the Non-Homogeneous Sequential Hypothesis Testing (NHSHT), where a single active Decision-Maker (DM) selects actions with heterogeneous positive costs to identify the true hypothesis under an average error constraint \(δ\), while minimizing expected total cost paid. Under standard arguments, we show that the objective decomposes into the product of the mean number of samples and the mean per-action cost induced by the policy. This leads to a key design principle: one should optimize t…

Output-Sparse Matrix Multiplication Using Compressed Sensing
Huck Bennett, Karthik Gajulapalli, Alexander Golovnev, Evelyn Warton
https://arxiv.org/abs/2508.10250 https://

Output-Sparse Matrix Multiplication Using Compressed Sensing
We give two algorithms for output-sparse matrix multiplication (OSMM), the problem of multiplying two $n \times n$ matrices $A, B$ when their product $AB$ is promised to have at most $O(n^δ)$ many non-zero entries for a given value $δ\in [0, 2]$. We then show how to speed up these algorithms in the fully sparse setting, where the input matrices $A, B$ are themselves sparse. All of our algorithms work over arbitrary rings. Our first, deterministic algorithm for OSMM works via a two-pass redu…

Residual Finiteness of Graph Wreath Products
Amy Needham
https://arxiv.org/abs/2509.11170 https://arxiv.org/pdf/2509.11170…

Residual Finiteness of Graph Wreath Products
We prove necessary and sufficient conditions for when graph wreath products are residually finite, generalising known results for the permutational wreath product and free product cases.

Sources: Meta plans its fourth AI restructuring in six months, dividing Superintelligence Labs into TBD Lab, a product team, an infrastructure team, and FAIR (Kalley Huang/The Information)
https://www.theinformation.com/articles/meta-plans-fourth…

Meta Plans Fourth Restructuring of AI Efforts in Six Months
Meta Platforms is planning the fourth restructuring of its artificial intelligence efforts in six months, according to three people familiar with the matter. Meta’s new AI organization, Meta Superintelligence Labs, is expected to be divided into four groups: a new lab that has been going by TBD ...

Personalized Product Search Ranking: A Multi-Task Learning Approach with Tabular and Non-Tabular Data
Lalitesh Morishetti, Abhay Kumar, Jonathan Scott, Kaushiki Nag, Gunjan Sharma, Shanu Vashishtha, Rahul Sridhar, Rohit Chatter, Kannan Achan
https://arxiv.org/abs/2508.09636

Personalized Product Search Ranking: A Multi-Task Learning Approach with Tabular and Non-Tabular Data
In this paper, we present a novel model architecture for optimizing personalized product search ranking using a multi-task learning (MTL) framework. Our approach uniquely integrates tabular and non-tabular data, leveraging a pre-trained TinyBERT model for semantic embeddings and a novel sampling technique to capture diverse customer behaviors. We evaluate our model against several baselines, including XGBoost, TabNet, FT-Transformer, DCN-V2, and MMoE, focusing on their ability to handle mixed d…

A Fibration Theorem and Chas-Sullivan product for Morse-Novikov Homology with differential graded coefficients
Robin Riegel (IRMA)
https://arxiv.org/abs/2508.09580 https://

A Fibration Theorem and Chas-Sullivan product for Morse-Novikov Homology with differential graded coefficients
Given an oriented, closed and connected manifold X and a nonzero cohomology u $\in$ H 1 (X, R), we extend the constructions of Morse Homology with differential graded coefficients of [BDHO25] and of the Chas-Sullivan product described on this model in [Rie24] to Morse-Novikov Homology with differential graded coefficients. More precisely, we will construct a Morse-Novikov complex with differential graded coefficients and prove that, given a fibration E $π$ $\rightarrow$ X such that $π$ * u = …

Erst wollt ich die coolen Dinger fürn Adventskalender aufheben, aber so what, hab ja eh nur 4 Paar dieser wie ich finde sehr chicen Fassungen da.
Daher jetzt auf #wandklexschmuck, eh klar, diese 3 fertig, 1x in Wunschfarbe bestellbar.

AI Answer Engine Citation Behavior An Empirical Analysis of the GEO16 Framework
Arlen Kumar, Leanid Palkhouski
https://arxiv.org/abs/2509.10762 https://arx…

AI Answer Engine Citation Behavior An Empirical Analysis of the GEO16 Framework
AI answer engines increasingly mediate access to domain knowledge by generating responses and citing web sources. We introduce GEO-16, a 16 pillar auditing framework that converts on page quality signals into banded pillar scores and a normalized GEO score G that ranges from 0 to 1. Using 70 product intent prompts, we collected 1,702 citations across three engines (Brave Summary, Google AI Overviews, and Perplexity) and audited 1,100 unique URLs. In our corpus, the engines differed in the GEO q…

Deconstructing Attention: Investigating Design Principles for Effective Language Modeling
Huiyin Xue, Nafise Sadat Moosavi, Nikolaos Aletras
https://arxiv.org/abs/2510.11602 htt…

Deconstructing Attention: Investigating Design Principles for Effective Language Modeling
The success of Transformer language models is widely credited to their dot-product attention mechanism, which interweaves a set of key design principles: mixing information across positions (enabling multi-token interactions), sequence-dependent activations (where attention weights adapt to each input), a specific mathematical form (dot-product similarities plus softmax weighting), and coupling of queries and keys to evolving hidden states (grounding attention in the current layer). However, th…

Agnostic Product Mixed State Tomography via Robust Statistics
Alvan Arulandu, Ilias Diakonikolas, Daniel Kane, Jerry Li
https://arxiv.org/abs/2510.08472 https://

Agnostic Product Mixed State Tomography via Robust Statistics
We consider the problem of agnostic tomography with \emph{mixed state} ansatz, and specifically, the natural ansatz class of product mixed states. In more detail, given $N$ copies of an $n$-qubit state $ρ$ which is $ε$-close to a product mixed state $π$, the goal is to output a nearly-optimal product mixed state approximation to $ρ$. While there has been a flurry of recent work on agnostic tomography, prior work could only handle pure state ansatz, such as product states or stabilizer state…

product_space: Atlas of Economic Complexity export network
Two networks of economic products, where a pair of products are connected if they are exported at similar rates by the same countries. The data are a projection from a bipartite network of nations and the products they export. Edges weights represent a similarity score (called "proximity"). Data based on UN Comtrade worldwide trade patterns. SITC network based on the Standard International Trade Classification and HS …

On the verification of a Nicolas inequality
Orlando Galdames-Bravo
https://arxiv.org/abs/2509.11182 https://arxiv.org/pdf/2509.11182

On the verification of a Nicolas inequality
Nicolas inequality we deal can be written as \begin{equation}\label{Nicineq} e^γ\log\log N_x < \dfrac{N_x}{φ(N_x)}\,, \end{equation} where $x\ge 2$, $N_x$ denotes the product of the primes less or equal than $x$, $γ$ is the Euler constant and $φ$ is the Euler totient function. We show that there is a large $x_0>0$ such that this inequality fails infinitely often for integers $x\ge x_0$. To this aim we analyze the sign of the Big-o function in the Mertens estimate for the sum of reciprocals …

Dimension of Bi-degree $(d,d)$ Spline Spaces with the Highest Order of Smoothness over Hierarchical T-Meshes
Bingru Huang, Falai Chen
https://arxiv.org/abs/2507.11047

Dimension of Bi-degree $(d,d)$ Spline Spaces with the Highest Order of Smoothness over Hierarchical T-Meshes
In this article, we study the dimension of the spline space of di-degree $(d,d)$ with the highest order of smoothness over a hierarchical T-mesh $\mathscr T$ using the smoothing cofactor-conformality method. Firstly, we obtain a dimensional formula for the conformality vector space over a tensor product T-connected component. Then, we prove that the dimension of the conformality vector space over a T-connected component of a hierarchical T-mesh under the tensor product subdivision can be calcul…

i don’t understand the product positioning they’re doing for the iPhone Pro, with the “tough sports power tool truck nuts” product design and marketing.
People went for the Pro instead of basic iPhone basically for the camera, no?
So people who want the better camera and just a normal phone now have… nothing.
Do they have a lot of demand for a tough sports power tool truck nuts phone?
And who wants the Air, that’s mainly more expensive than the basic phone but has a worse camera?

Prioritizing Recurrent Services
Lin (Franklin), Feng, Yue Hu, Xu Kuang
https://arxiv.org/abs/2509.11383 https://arxiv.org/pdf/2509.11383

Prioritizing Recurrent Services
We study optimal scheduling in multi-class queueing systems with reentrance, where jobs may return for additional service after completion. Such reentrance creates feedback loops that fundamentally alter congestion dynamics and challenge classical scheduling results. We model two distinct dimensions of the reentrance behavior, the probability of return and the speed of return, and show that their product, the effective return rate, is the key statistic that governs optimal priorities. Our main …

Crosslisted article(s) found for cs.CL. https://arxiv.org/list/cs.CL/new
[1/1]:
- Personalized Product Search Ranking: A Multi-Task Learning Approach with Tabular and Non-Tabular ...
Morishetti, Kumar, Scott, Nag, Sharma, Vashishtha, Sridhar, Chatter, Achan

Paramount hires Meta's Dane Glasgow as chief product officer, reporting directly to CEO David Ellison; Glasgow is Facebook's former VP of product management (Alex Weprin/The Hollywood Reporter)
https://www.hollywoodreporter.com/business

Paramount Hires Meta Exec as Chief Product Officer Amid Tech Reinvention
Dane Glasgow was most recently a vp at Facebook, overseeing the feed, Reels, Stories, Marketplace and other features. He will report to David Ellison.

Bound on entanglement in neural quantum states
Nisarga Paul
https://arxiv.org/abs/2510.11797 https://arxiv.org/pdf/2510.11797

Bound on entanglement in neural quantum states
Variational wavefunctions offer a practical route around the exponential complexity of many-body Hilbert spaces, but their expressive power is often sharply constrained. Matrix product states, for instance, are efficient but limited to area law entangled states. Neural quantum states (NQS) are widely believed to overcome such limitations, yet little is known about their fundamental constraints. Here we prove that feed-forward neural quantum states acting on $n$ spins with $k$ scalar nonlinearit…

On the Squared Distance Matrix of a Starlike Block Graph
Joyentanuj Das, Sumit Mohanty
https://arxiv.org/abs/2509.10854 https://arxiv.org/pdf/2509.10854

On the Squared Distance Matrix of a Starlike Block Graph
Let $D(G)$ be the distance matrix of a simple connected graph $G$. The Hadamard product $D(G)~\circ~ D(G)$ is called the squared distance matrix of $G$, and is denoted by $Δ(G)$. A simple connected graph is called a starlike block graph if it has a central cut vertex, and each of its blocks is a complete graph. Let $ \mathcal{S}(n_1, n_2, \ldots, n_b)$ be the starlike block graph with blocks $K_{n_1+1}, K_{n_2+1}, \ldots, K_{n_b+1} $ on $n=1 + \sum_{i=1}^b n_i$ vertices. In this article, we co…

Clicks Versus Conversion: Choosing a Recommender's Training Objective in E-Commerce
Michael Weiss, Robert Rosenbach, Christian Eggenberger
https://arxiv.org/abs/2508.10377 h…

Clicks Versus Conversion: Choosing a Recommender's Training Objective in E-Commerce
Ranking product recommendations to optimize for a high click-through rate (CTR) or for high conversion, such as add-to-cart rate (ACR) and Order-Submit-Rate (OSR, view-to-purchase conversion) are standard practices in e-commerce. Optimizing for CTR appears like a straightforward choice: Training data (i.e., click data) are simple to collect and often available in large quantities. Additionally, CTR is used far beyond e-commerce, making it a generalist, easily implemented option. ACR and OSR, on…

OpenAI's massive deals show Sam Altman is selling a vision of a world-changing product and achieving it via world-changing financial engineering to raise $1T (Matt Levine/Bloomberg)
https://www.bloomberg.com/opinion/newsletters/2025-10-13/openai-keeps-d…

Ach ja: das ovm letzten Post wird bzw. ist für sowas.
Handgemalter #wandklexschmuck, eh klar - zu finden auf https://www.wandklex.art/product/handgemalte-aquarellminiaturen-brigg-als-halsschmuck-oder-armschmuck-508480.

kegg_metabolic: Metabolic networks from KEGG (2006)
109 metabolic networks of various species, as extracted from the Kyoto Encyclopedia of Genes and Genomes (KEGG) database in March 2006. Nodes are substances involved in enzymatic reactions present in the organism, and edges represent reactant-product pairs as extracted from the KEGG ligand database and matched against the present enzymes.
This network has 1509 nodes and 4256 edges.
Tags: Biological, Metabolic, Unweighted…

High-dimensional autocompensating discrete modulation CV-QKD protocol in optical fibers
Alexandre V\'azquez-Mart\'inez, Xes\'us Prieto-Blanco, Eduardo F. Mateo, Jes\'us Li\~nares
https://arxiv.org/abs/2508.10442

High-dimensional autocompensating discrete modulation CV-QKD protocol in optical fibers
In this work we present a high-dimensional discrete modulated CV-QKD protocol, with dimension 2N , in optical fibers, where N is the number of optical modes. We use N-dimensional product states of weak coherent states that undergo perturbations along optical fibers and that are cancelled in a passive way (autocompensation) and then measured by a standard balanced homodyne detection. We analyze the security of this high-dimensional protocol when an intercept and resend attack is implemented with…

Bounded Littlewood identities with fixed number of odd rows or odd columns
JiSun Huh, Jang Soo Kim, Christian Krattenthaler, Soichi Okada
https://arxiv.org/abs/2510.11054 https:…

Bounded Littlewood identities with fixed number of odd rows or odd columns
A Littlewood identity is an identity equating a sum of Schur functions with an infinite product. A bounded Littlewood identity is one where the sum is taken over the partitions with a bounded number of rows or columns. The price to pay is that the infinite product has to be replaced by a determinant. The focus of this article is on refinements of such bounded Littlewood identities where one also prescribes the number of odd-length rows or columns of the partitions. Goulden [{\it Discrete Math.}…

At Dreamforce 2025, Salesforce unveils Agentforce 360, a unified agentic AI stack to connect humans, AI agents, and more, and positions Slack as an "agentic OS" (Larry Dignan/Constellation Research)
https://www.constellationr.com/blog-news/i

Salesforce makes its Agentforce 360 case to be your AI agent platform
Salesforce announced a series of product updates, a process intelligence acquisition and an Agentforce 360 architecture designed to make the case that it should orchestrate first and third party AI agents. At Dreamforce 2025, Salesforce looked to differentiate itself from what's becoming a crowded agentic AI platform space. The cloud giants are looking to go horizontal with stacks to build, deploy and optimize AI agents. SaaS vendors are expanding into managing AI agents beyond their verticals.…

LLP: LLM-based Product Pricing in E-commerce
Hairu Wang, Sheng You, Qiheng Zhang, Xike Xie, Shuguang Han, Yuchen Wu, Fei Huang, Jufeng Chen
https://arxiv.org/abs/2510.09347 http…

LLP: LLM-based Product Pricing in E-commerce
Unlike Business-to-Consumer e-commerce platforms (e.g., Amazon), inexperienced individual sellers on Consumer-to-Consumer platforms (e.g., eBay) often face significant challenges in setting prices for their second-hand products efficiently. Therefore, numerous studies have been proposed for automating price prediction. However, most of them are based on static regression models, which suffer from poor generalization performance and fail to capture market dynamics (e.g., the price of a used iPho…

Wave-Based Semantic Memory with Resonance-Based Retrieval: A Phase-Aware Alternative to Vector Embedding Stores
Aleksandr Listopad
https://arxiv.org/abs/2509.09691 https://

Wave-Based Semantic Memory with Resonance-Based Retrieval: A Phase-Aware Alternative to Vector Embedding Stores
Conventional vector-based memory systems rely on cosine or inner product similarity within real-valued embedding spaces. While computationally efficient, such approaches are inherently phase-insensitive and limited in their ability to capture resonance phenomena crucial for meaning representation. We propose Wave-Based Semantic Memory, a novel framework that models knowledge as wave patterns $ψ(x) = A(x) e^{iϕ(x)}$ and retrieves it through resonance-based interference. This approach preserves…

Von führenden Meerjungfrauen empfohlen ☺
Die handgemalten #wandklexschmuck Galaxien sind in Echt 925 Sterling Silber gefasst; gibts auch in echtvergoldet - und in mehreren Galaxienfarben. Zu finden auf https://www.wandklex.art/product/zierlicher-nixe-galaxien-ohrhaenger-oder-halsschmuck-handgemalte-farbnebel-in-meerjungfrauen-anhaenger-aus-925-sterling-silber-echtsilber-original-aquarell-223108.

Replaced article(s) found for quant-ph. https://arxiv.org/list/quant-ph/new
[2/3]:
- Efficient mutual magic and magic capacity with matrix product states
Poetri Sonya Tarabunga, Tobias Haug

Some conjectures of Schlosser and Zhou on sign patterns of the coefficients of infinite products
Bing He, Linpei Li
https://arxiv.org/abs/2509.10023 https://

Some conjectures of Schlosser and Zhou on sign patterns of the coefficients of infinite products
Recently, Schlosser and Zhou proposed many conjectures on sign patterns of the coefficients appearing in the $q$-series expansions of the infinite Borwein product and other infinite products raised to a real power. In this paper, we will study several of these conjectures. Let \[ G(q):=\prod_{i=1}^{I}\left(\prod_{k=0}^{\infty}(1-q^{m_{i}+kn_{i}})(1-q^{-m_{i}+(k+1)n_{i}})\right)^{u_{i}} \] where $I$ is a positive integer, $1\leq m_{i}

epinions: Epinions product ratings (2005)
A bipartite network of users and the products they rated on the website Epinions.com. A user connects to all products on which that user entered a rating. Edge weight represents the rating score, and edges are timestamped.
This network has 876252 nodes and 13668320 edges.
Tags: Economic, Preferences, Timestamps, Weighted

Generating Query-Relevant Document Summaries via Reinforcement Learning
Nitin Yadav, Changsung Kang, Hongwei Shang, Ming Sun
https://arxiv.org/abs/2508.08404 https://

Generating Query-Relevant Document Summaries via Reinforcement Learning
E-commerce search engines often rely solely on product titles as input for ranking models with latency constraints. However, this approach can result in suboptimal relevance predictions, as product titles often lack sufficient detail to capture query intent. While product descriptions provide richer information, their verbosity and length make them unsuitable for real-time ranking, particularly for computationally expensive architectures like cross-encoder ranking models. To address this challe…

Approximating the operator norm of local Hamiltonians via few quantum states
Lars Becker, Joseph Slote, Alexander Volberg, Haonan Zhang
https://arxiv.org/abs/2509.11979 https://…

Approximating the operator norm of local Hamiltonians via few quantum states
Consider a Hermitian operator $A$ acting on a complex Hilbert space of dimension $2^n$. We show that when $A$ has small degree in the Pauli expansion, or in other words, $A$ is a local $n$-qubit Hamiltonian, its operator norm can be approximated independently of $n$ by maximizing $|\braket{ψ|A|ψ}|$ over a small collection $\mathbf{X}_n$ of product states $\ketψ\in (\mathbf{C}^{2})^{\otimes n}$. More precisely, we show that whenever $A$ is $d$-local, \textit{i.e.,} $°(A)\…

Completions of pairwise comparison data that minimize the triad measure of inconsistency
Susana Furtado, Charles Johnson
https://arxiv.org/abs/2510.12351 https://

Completions of pairwise comparison data that minimize the triad measure of inconsistency
We consider incomplete pairwise comparison matrices and determine exactly when they have a consistent completion and, if not, when they have a nearly consistent completion. We use the maximum 3-cycle product as a measure of inconsistency and show that, when the graph of the specified entries is chordal, a completion in which this measure is not increased is always possible. Methodology to produce such completions is developed. Such methodology may also be used to reduce inconsistency with few c…

Causal Inspired Multi Modal Recommendation
Jie Yang, Chenyang Gu, Zixuan Liu
https://arxiv.org/abs/2510.12325 https://arxiv.org/pdf/2510.12325

Causal Inspired Multi Modal Recommendation
Multimodal recommender systems enhance personalized recommendations in e-commerce and online advertising by integrating visual, textual, and user-item interaction data. However, existing methods often overlook two critical biases: (i) modal confounding, where latent factors (e.g., brand style or product category) simultaneously drive multiple modalities and influence user preference, leading to spurious feature-preference associations; (ii) interaction bias, where genuine user preferences are m…

Improved Quantum Lifting by Coherent Measure-and-Reprogram
Alexandru Cojocaru, Juan Garay, Qipeng Liu, Fang Song
https://arxiv.org/abs/2509.09896 https://a…

Improved Quantum Lifting by Coherent Measure-and-Reprogram
We give a tighter lifting theorem for security games in the quantum random oracle model. At the core of our main result lies a novel measure-and-reprogram framework that we call coherent reprogramming. This framework gives a tighter lifting theorem for query complexity problems, that only requires purely classical reasoning. As direct applications of our lifting theorem, we first provide a quantum direct product theorem in the average case - i.e., an enabling tool to determine the hardness of s…

Mira Murati's Thinking Machines Lab launches its first product, Tinker, which automates the creation of custom frontier AI models (Will Knight/Wired)
https://www.wired.com/story/thinking-machines-lab-first-product-fine-tune/

Exclusive: Mira Murati’s Stealth AI Lab Launches Its First Product
Thinking Machines Lab, led by a group of prominent former OpenAI researchers, is betting that fine tuning cutting-edge models will be the next frontier in AI.

product_space: Atlas of Economic Complexity export network
Two networks of economic products, where a pair of products are connected if they are exported at similar rates by the same countries. The data are a projection from a bipartite network of nations and the products they export. Edges weights represent a similarity score (called "proximity"). Data based on UN Comtrade worldwide trade patterns. SITC network based on the Standard International Trade Classification and HS …

Quadratic Embedding Constants of Cartesian Products and Joins of Graphs
Projesh Nath Choudhury, Raju Nandi
https://arxiv.org/abs/2508.10834 https://arxiv.o…

Quadratic Embedding Constants of Cartesian Products and Joins of Graphs
The quadratic embedding constant (QEC) of a finite, simple, connected graph originated from the classical work of Schoenberg [Ann. of Math., 1935] and [Trans. Amer. Math. Soc., 1938] on Euclidean distance geometry. In this article, we study the QEC of graphs in terms of two graph operations: the Cartesian product and the join of graphs. We derive a general formula for the QEC of the join of an arbitrary graph with a regular graph and with a complete multipartite graph. We then provide quadratic…

Simulating and Sampling from Quantum Circuits with 2D Tensor Networks
Manuel S. Rudolph, Joseph Tindall
https://arxiv.org/abs/2507.11424 https://

Simulating and Sampling from Quantum Circuits with 2D Tensor Networks
Classical simulations of quantum circuits play a vital role in the development of quantum computers and for taking the temperature of the field. Here, we classically simulate various physically-motivated circuits using 2D tensor network ansätze for the many-body wavefunction which match the geometry of the underlying quantum processor. We then employ a generalized version of the boundary Matrix Product State contraction algorithm to controllably generate samples from the resultant tensor netwo…

Dynamic Network-Based Two-Stage Time Series Forecasting for Affiliate Marketing
Zhe Wang, Yaming Yang, Ziyu Guan, Bin Tong, Rui Wang, Wei Zhao, Hongbo Deng
https://arxiv.org/abs/2510.11323

Dynamic Network-Based Two-Stage Time Series Forecasting for Affiliate Marketing
In recent years, affiliate marketing has emerged as a revenue-sharing strategy where merchants collaborate with promoters to promote their products. It not only increases product exposure but also allows promoters to earn a commission. This paper addresses the pivotal yet under-explored challenge in affiliate marketing: accurately assessing and predicting the contributions of promoters in product promotion. We design a novel metric for evaluating the indirect contributions of the promoter, call…

product_space: Atlas of Economic Complexity export network
Two networks of economic products, where a pair of products are connected if they are exported at similar rates by the same countries. The data are a projection from a bipartite network of nations and the products they export. Edges weights represent a similarity score (called "proximity"). Data based on UN Comtrade worldwide trade patterns. SITC network based on the Standard International Trade Classification and HS …

Log-Concavity and Log-Convexity of Restricted Infinite Products
Krystian Gajdzica, Bernhard Heim, Markus Neuhauser
https://arxiv.org/abs/2509.11246 https://

Log-Concavity and Log-Convexity of Restricted Infinite Products
In this paper we provide a classification on the sign distribution of $Δ_{E,\ell}(n):= p_{E,\ell }(n)^2 - p_{E,\ell }(n-1) \, p_{E,\ell }(n+1)$, where \begin{equation*} \sum_{n =0}^{\infty} p_{E,\ell }(n) \, q^n := \prod_{n \in S} \left(1 - q^n \right)^{-f_{\ell}(n)},\quad (\ell \in \mathbb{N}, f_1\equiv 1). \end{equation*} We take the product over $1\in S \subset \mathbb{N}$ and denote the complement by $E$, the set of exceptions. In the case of $\ell=1$ and $E$ the multiples of $k$, $p_{E,…

Quantum Circuit Complexity of Matrix-Product Unitaries
Georgios Styliaris, Rahul Trivedi, J. Ignacio Cirac
https://arxiv.org/abs/2508.08160 https://arxiv.o…

Quantum Circuit Complexity of Matrix-Product Unitaries
Matrix-product unitaries (MPUs) are many-body unitary operators that, as a consequence of their tensor-network structure, preserve the entanglement area law in 1D systems. However, it is unknown how to implement an MPU as a quantum circuit since the individual tensors describing the MPU are not unitary. In this paper, we show that a large class of MPUs can be implemented with a polynomial-depth quantum circuit. For an $N$-site MPU built from a repeated bulk tensor with open boundary, we explici…

Transition Matrices between Plethystic Bases of Polysymmetric Functions via Bijective Methods
Aditya Khanna
https://arxiv.org/abs/2510.12723 https://arxiv.…

Transition Matrices between Plethystic Bases of Polysymmetric Functions via Bijective Methods
Many identities involving symmetric functions can be proved through bijective manipulations of tableaux. In this paper, we prove identities involving polysymmetric functions through bijections and sign-reversing involutions. In their paper titled "Polysymmetric functions and motivic measures of configuration spaces", Asvin G and Andrew O'Desky introduced the algebra of polysymmetric functions (PSym) which can be defined as the tensor product of copies of the symmetric functions algebra (Sym) wh…

Tomography-assisted noisy quantum circuit simulator using matrix product density operators
Wei-guo Ma, Yun-Hao Shi, Kai Xu, Heng Fan
https://arxiv.org/abs/2508.07610 https://

Tomography-assisted noisy quantum circuit simulator using matrix product density operators
In recent years, efficient quantum circuit simulations incorporating ideal noise assumptions have relied on tensor network simulators, particularly leveraging the matrix product density operator (MPDO) framework. However, experiments on real noisy intermediate-scale quantum (NISQ) devices often involve complex noise profiles, encompassing uncontrollable elements and instrument-specific effects such as crosstalk. To address these challenges, we employ quantum process tomography (QPT) techniques …