English
Related papers

Related papers: Redundant generating functions in lattice path enu…

200 papers

We explain a discontinuous drop in the exponential growth rate for certain multivariate generating functions at a critical parameter value, in even dimensions d at least 4. This result depends on computations in the homology of the…

Combinatorics · Mathematics 2022-04-11 Yuliy Baryshnikov , Stephen Melczer , Robin Pemantle

Deep generative models are proven to be a useful tool for automatic design synthesis and design space exploration. When applied in engineering design, existing generative models face three challenges: 1) generated designs lack diversity and…

Machine Learning · Computer Science 2021-08-17 Wei Chen , Faez Ahmed

We provide formulas for generating functions of many types of paths in various rooted tree structures. We compute the $k$th moment of the generating functions for various types of vertical paths. In two specific familes of trees we find…

Combinatorics · Mathematics 2018-10-03 Keith Copenhaver

Colors and shapes are commonly used to encode categories in multi-class scatterplots. Designers often combine the two channels to create redundant encodings, aiming to enhance class distinctions. However, evidence for the effectiveness of…

Human-Computer Interaction · Computer Science 2026-04-14 Chin Tseng , Arran Zeyu Wang , Ghulam Jilani Quadri , Danielle Albers Szafir

Divide-and-conquer functions satisfy equations in F(z),F(z^2),F(z^4)... Their generated sequences are mainly used in computer science, and they were analyzed pragmatically, that is, now and then a sequence was picked out for scrutiny. By…

Combinatorics · Mathematics 2007-05-23 Ralf Stephan

We present a general theorem on the structure of bivariate generating functions which gives sufficient conditions such that the limiting probability distribution is a half-normal distribution. If $X$ is a normally distributed random…

Combinatorics · Mathematics 2020-05-19 Michael Wallner

How should future neural reasoning systems implement extended computation? Recursive Reasoning Models (RRMs) offer a promising alternative to autoregressive sequence extension by performing iterative latent-state refinement with shared…

Artificial Intelligence · Computer Science 2026-05-21 Junyeob Baek , Mingyu Jo , Minsu Kim , Mengye Ren , Yoshua Bengio , Sungjin Ahn

While automata theory often concerns itself with regular predicates, relations corresponding to acceptance by a finite state automaton, in this article we study the regular functions, such relations which are also functions in the…

Formal Languages and Automata Theory · Computer Science 2016-10-25 Thomas Kern

In a recent preprint, Lai and Rohatgi compute the generating functions of lozenge tilings of "quartered hexagons with dents" by applying the method of "graphical condensation". The purpose of this note is to exhibit how (a generalization…

Combinatorics · Mathematics 2021-01-19 Markus Fulmek

We prove (without exceptions) the existence of irredundant tensor decompositions with the number of addenda equal to rank $+1$. We also discuss the existence of decompositions with more than the tensor rank terms, which are concise, while…

Algebraic Geometry · Mathematics 2020-02-17 Edoardo Ballico

We develop a method for generating causal post-hoc explanations of black-box classifiers based on a learned low-dimensional representation of the data. The explanation is causal in the sense that changing learned latent factors produces a…

Machine Learning · Computer Science 2020-10-23 Matthew O'Shaughnessy , Gregory Canal , Marissa Connor , Mark Davenport , Christopher Rozell

Gravitationally collapsed objects are known to be biased tracers of an underlying density contrast. Using symmetry arguments, generalised biasing schemes have recently been developed to relate the halo density contrast $\delta_h$ with the…

Cosmology and Nongalactic Astrophysics · Physics 2018-02-14 Dipak Munshi

There exist very lucid explanations of the combinatorial origins of rational and algebraic functions, in particular with respect to regular and context free languages. In the search to understand how to extend these natural correspondences,…

Information Theory · Computer Science 2008-02-21 Marni Mishna , Mike Zabrocki

This paper is concerned with the characterizations of fixed points of the generating function of branching processes with countably infinitely many types. We assume each particle of type $i$ can only give offspring of type $j\geq i$, whose…

Probability · Mathematics 2024-04-10 Jiangrui Tan , Mei Zhang

Defeasible reasoning is the mode of reasoning where conclusions can be overturned by taking into account new evidence. A commonly used method in cognitive science and logic literature is to handcraft argumentation supporting inference…

Computation and Language · Computer Science 2021-06-01 Aman Madaan , Dheeraj Rajagopal , Niket Tandon , Yiming Yang , Eduard Hovy

We study the problem of efficiently producing, in an online fashion, generative models of scalar, multiclass, and vector-valued outcomes that cannot be falsified on the basis of the observed data and a pre-specified collection of…

Machine Learning · Computer Science 2026-02-26 Gabriele Farina , Juan Carlos Perdomo

Trajectory anomaly detection, aiming to estimate the anomaly risk of trajectories given the Source-Destination (SD) pairs, has become a critical problem for many real-world applications. Existing solutions directly train a generative model…

Machine Learning · Computer Science 2024-12-30 Wenbin Li , Di Yao , Chang Gong , Xiaokai Chu , Quanliang Jing , Xiaolei Zhou , Yuxuan Zhang , Yunxia Fan , Jingping Bi

Large statically indeterminate truss and frame structures exhibit complex load-bearing behavior, and redundancy matrices are helpful for their analysis and design. Depending on the task, the full redundancy matrix or only its diagonal…

Computational Engineering, Finance, and Science · Computer Science 2024-02-14 Anton Tkachuk , Tim Krake , Jan Gade , Malte von Scheven

In this article we investigate the L^1-norm of certain functions on groups called divisibility functions. Using these functions, their connection to residual finiteness, and integration theory on profinite groups, we define the residual…

Group Theory · Mathematics 2012-11-21 K. Bou-Rabee , D. B. McReynolds

A knowledge base is redundant if it contains parts that can be inferred from the rest of it. We study the problem of checking whether a CNF formula (a set of clauses) is redundant, that is, it contains clauses that can be derived from the…

Artificial Intelligence · Computer Science 2007-07-25 Paolo Liberatore