Welcome to my home page!

In today’s fast-growing digital world, professionals who understand online marketing and technology play a vital role in helping businesses succeed. One such professional is **Wajahat Hussain Aziz**, a Pakistani digital marketing expert known for his work in SEO, web development, and online branding.

---

# Background and Professional Identity

**Wajahat Hussain Aziz** is recognized as a **digital marketer, SEO specialist, and web developer** based in Pakistan. He has built his career around helping businesses improve their online visibility and achieve sustainable growth through effective digital strategies.

---

# Founder of a Digital Marketing Agency

Wajahat Hussain Aziz is the founder of a digital marketing agency operating under the brand **Wajahat Writes**. His agency focuses on delivering long-term digital solutions for startups, entrepreneurs, and established businesses. The services are designed to enhance brand presence, increase organic traffic, and improve overall online performance.

---

# Areas of Expertise

His professional expertise includes:

- **Search Engine Optimization (SEO)**
Implementing on-page, off-page, and technical SEO strategies to improve search engine rankings.

- **Digital Marketing Strategy**
Creating data-driven marketing campaigns tailored to business goals.

- **Web Development**
Designing and optimizing websites using platforms such as WordPress, HTML, and CSS.

- **Online Branding**
Helping businesses build a strong, credible, and consistent digital identity.

---

# Education and Technical Skills

According to publicly available information, Wajahat Hussain Aziz has an academic background in **computer science and project management**. This educational foundation supports his technical expertise and structured approach to managing digital projects efficiently.

---

# Professional Vision and Impact

Wajahat Hussain Aziz emphasizes ethical SEO practices, continuous learning, and adapting to evolving digital trends. His goal is to help businesses grow organically while maintaining quality, credibility, and measurable results.

---

# Conclusion

In summary, **Wajahat Hussain Aziz** is a dedicated digital marketing professional specializing in SEO, web development, and online marketing. Through his agency and consulting services, he continues to support businesses in building strong digital foundations and achieving long-term success.

---

# References

- Wajahat Writes – Official Website:
wajahatwrites.com/

- Profile Overview:
wajahatwrites.com/who-is-wajahat-hussain-aziz/

Welcome to my home page!

Welcome to my home page!

Numerical solution:

Earliest known public leak: github.com/lucky-bai/projecteuler-solutions/pull/88

Programs:

Numerical solution:

Earliest known public leak: github.com/lucky-bai/projecteuler-solutions/issues/105

This problem took several months to get publicly leaked, one of the longest by far on github.com/lucky-bai/projecteuler-solutions

Programs:

Likely accounts:

Bibliography:

The opposite of the AGI blues. In 2025 Ciro Santilli fell well in this camp.

A hero.

1. Introduction

As System-on-Chip (SoC) architectures incorporate billions of transistors, the ability to accurately predict design properties has become paramount ${}^5$. Early-stage architectural design and physical synthesis rely heavily on robust models that quantify the relationship between logic complexity and the communication requirements between disparate system blocks.

The foundational model in this domain is Rent's Rule ${}^1$. Discovered empirically by E. F. Rent at IBM and later formalized by Landman and Russo ${}^2$, the rule establishes a power-law relationship between the number of external signal connections (terminals) to a logic block and the number of internal components (gates or standard cells) it contains:Where:
• $T$: Number of external terminals (pins) of the block.
• $g$: Number of internal logic components (gates/cells).
• $K$: Rent's empirical constant (average pins per block).
• $p$: Rent exponent ($0<p<1$).

While Rent's Rule is an indispensable tool for wire length ${}^3{,}^4$ and placement optimization, its empirical origins lead to inherent limitations—especially when applied to modern, heterogeneous architectures. This paper discusses New Law ${}^5$ and a new generalization, which addresses these shortcomings by incorporating explicit structural constraints, extending its utility to the next generation of complex computing systems.
________________________________________
2. Overview of Rent's Rule and Current Drawbacks
2.1. Applications and Interpretation

Rent's Rule describes a statistical self-similarity in digital systems. The Rent exponent ($p$) provides insight into a design's topological complexity:
• $p\approx 0.4$: Highly regular structures.
• $p\approx 0.5$: Structured designs with high locality (e.g., SRAM).
• $p\approx 0.75$: "Random logic" or complex, unstructured designs.

2.2. Limitations

The power-law form suffers from two primary drawbacks ${}^6{,}^8$:
1. Terminal Constraint Deviation (Region II) ${}^7$: The power law breaks down as partitions approach the total system size ($>25\%$ of the chip). Physical I/O pins are finite; thus, the log-log plot flattens as $g$ approaches $N$.
2. Undefined Constants: There is an absence of methodology relating design metrics to the empirical constants $K$ and $p$.

________________________________________
3. The New Rule: Generalization for Autonomic Systems

We utilized a graph-mathematical model to generalize Rent’s Rule, specifically addressing its limitations when applied to autonomic systems. We demonstrated that the classical power-law form of Rent’s Rule is valid only under the restrictive conditions where the system contains a large number of blocks, and the number $g$ of internal components in a block is much smaller than the total number of components ($N$) in the entire system ${}^9$.

The generalized formulation, referred to as the New Graph-based Rule, extends the applicability of the scaling law across the entire range of partition sizes, including the problematic Rent's Region II. The New Rule is expressed as ${}^9{,}^{10}{,}^{11}$:Where:
• $T$ is the number of external terminals for the block partition.
• $N$ is the total number of components in the system.
• $g$ is the number of components in the block partition.
• $t$ represents the average number of pins of a component in the system.
• $P_g$ is the generalized Rent exponent, derived by the described graph-partitioning method.

The rule was derived by modeling the system as a graph, where each component is represented as a vertex, and each net is represented as a tree connecting its components.

Figure 1. "All Net Components Are in the Block" illustrates the case when a net connects three components ($A$, $B$, and $C$) and is represented as a net tree. In this example, all net components are in the same block; thus, there is no need for a block external terminal—none of the net edges exit the block.

Figure 2. "An external terminal" illustrates the same case, but only components $A$ and $B$ are in the same block, while component $C$ is located in another block. In this scenario, an edge exits the block to connect to component $C$, necessitating a block external terminal for the net under consideration.

3.1. Derivation Logic

Initially, we assumed that each block has randomly assigned components. Under this assumption, the probability $Q^{\prime }$ that a given pin of a given component has an edge to another component outside of the block is:If the net has only two components to connect (the net tree is a single edge), the above formula is straightforward. In this case, the edge goes outside the block, creating one block terminal. If the net has $m>2$ pins to connect, we still have only one outside terminal—all components of the net within the block are connected by an internal net-tree, requiring only one tree edge to exit the block.

Because the component under consideration has $t$ pins on average, the probability $Q$ that the component will have $t$ edges (block terminals) to components in other blocks is:With $g$ components in the block, the number of expected block terminals is:The drawback of formula $[2]$ is the assumption of random component assignment. In reality, blocks are not designed randomly; highly connected components are partitioned into the same block to minimize communication overhead. Therefore, formula $[2]$ produces conservative results. To account for the effect of optimized partitioning that minimizes terminals, we introduce a correction constant $P_g<1$ (analogous to the Rent exponent), which reduces the estimated number of terminals:

By substituting the variables from $[2]$ into $[3]$, we arrive at the generalized New Rule $[1]$.

3.2. Behavioral Cases

• Case 1 ($g=1$): Simplifies to $T=t$, matching classical expectations.
• Case 2 ($g=N/2$): Yields the maximum terminal count, reflecting the peak communication requirement when a system is halved.
• Case 3 ($g=N$): $T=0$. This accurately models Region II, as a closed system has no external signals.

________________________________________
4. A Hypergraph Model

Above, we utilized a graph-mathematical model to generalize Rent’s Rule. We will show that if we use a hypergraph model of the system, we can further improve the accuracy of the generalized Rent’s Rule by taking into account an additional and known design property: the average number of components, $m$, that a net connects.

Let’s represent a net that connects $m$ pins as a hyperedge, instead of a tree as used in the previous graph-based model. Note that $m$ is a known design property and is the average value that can be obtained for any real design.

Figure 3. "All three components and the hyperedge are within the Block" illustrates the case when a net connects three components ($A$, $B$, and $C$) and is represented as a hyperedge (an oval encompassing all components). In this example, all net components are in the same block, and there is no need for a block external terminal—the hyperedge does not cross the block boundary.

4.1. Hypergraph Derivation

Again, let’s initially assume that each block has randomly assigned components. Then, the probability $V^{\prime \prime }$ that a given pin of a given component within the block is connected to another component within that same block is:The probability $V^{\prime }$ that the remaining $m-1$ vertices (components) within the hyperedge are all located in the block (resulting in no block terminal for this net) is:This implies that the probability $Q^{\prime }$ that the hyperedge will exit the block (necessitating a block terminal) is:Because the component under consideration has $t$ pins on average, the probability $Q$ that the component will have $t$ hyperedges (block terminals) connecting to components in other blocks is:The above formula reflects the physical reality that the more components of a net are located within the block, the lower the probability that the net will exit the block. If all $m$ components of a net are in the block, the net requires no block terminal.
With $g$ components in the block, the number of expected block terminals is:Again, the drawback of formula $[3]$ is the assumption of random component assignment. In reality, highly connected components are partitioned together to minimize external terminals. Thus, formula $[3]$ produces conservative results. To account for optimized partitioning, we introduce a correction constant $P_h<1$ (similar to $P_g$) to reduce the estimated number of terminals:After substituting the variables into $[4]$, we arrive at the New Hypergraph-based Rule:It is easy to see that if each net connects only two components ($m=2$), the New Hypergraph-based Rule becomes equivalent to the New Graph-based Rule.

Our comparative study of graph-based versus hypergraph-based rules showed that the hypergraph model is approximately 1.2% more accurate.

Figure 4. "Comparison of the Rules" illustrates a comparison of Rent’s Rule against the new generalizations.

Properties used: $N=10,000$; $K=4$; $P_{rent}=0.6$; $t=4$; $P_g=0.6$; $m=3.2$; $P_h=0.23$.

4.2 Justification Summary

The following final points support the justification of the new rules:
• Experimental Alignment: They provide a superior match to experimental data across all regions.
• Convergence: Terminal counts are close to Rent’s predictions when $g$ is small.
• Structural Commonality: There is a fundamental commonality in the rule structures; they can be effectively approximated by Rent’s Rule for very small $g$.

________________________________________
5. Conclusion

The proposed New Rules resolve long-standing issues in VLSI modeling by explicitly incorporating $N$ (system size), $t$ (average pins), and $m$ (net fan-out). By naturally constraining terminal counts at $g=N$, these rules provide a mathematically sound bridge across both Region I and Region II of Rent's curve.
________________________________________
References

1. Rent, E.F. (1960): Original discovery (often an internal IBM memorandum).

2. Landman, L.A. and Russo, R.L. (1971): "On Pin Versus Block Relationship for Partitions of Logic Graphs," IEEE Transactions on Computers, vol. C-20, no. 12, pp. 1469-1479.

3. Donath, W.E. (1981): "Wire Length Distribution for Computer Logic," IBM Technical Disclosure Bulletin, vol. 23, no. 11, pp. 5865-5868.

4. Heller, W.R., Hsi, C. and Mikhail, W.F. (1978): "Chip-Level Physical Design: An Overview," IEEE Transactions on Electron Devices, vol. 25, no. 2, pp. 163-176.

5. Natalie Heroux (2025): “Tetelbaum’s Law of Computer Systems, ourbigbook.com/nheroux/tetelbaum%E2%80%99s-law-of-computer-systems

6. Sutherland, I.E. and Oosterhout, W.J. (2001): "The Futures of Design: Interconnections," ACM/IEEE Design Automation Conference (DAC), pp. 15-20.

7. Davis, J. A. and Meindl, J. D. (2000): "A Hierarchical Interconnect Model for Deep Submicron Integrated Circuits," IEEE Transactions on Electron Devices, vol. 47, no. 11, pp. 2068-2073.

8. Stroobandt, D. A. and Van Campenhout, J. (2000): "The Geometry of VLSI Interconnect," Proceedings of the IEEE, vol. 88, no. 4, pp. 535-546.

9. TETELBAUM, A. (1995). "Generalizations of Rent's Rule", in Proc. of 27th IEEE Southeastern Symposium on System Theory, Starkville, Mississippi, USA, March 1995, pp. 011-016.

10. TETELBAUM, A. (1995). "Estimations of Layout Parameters of Hierarchical Systems", in Proc. of 27th IEEE Southeastern Symposium on System Theory, Starkville, Mississippi, USA, March 1995, pp. 123-128.

11. TETELBAUM, A. (1995). "Estimation of the Graph Partitioning for a Hierarchical System", in Proc. of the Seventh SIAM Conference on Parallel Processing for Scientific Computing, San Francisco, California, USA, February 1995, pp. 500-502.
________________________________________

Welcome to my home page!

Welcome to my home page!

Abstract

The divergence between executive compensation and median employee wages has reached historic levels, yet current methods for determining "fair" pay often rely on peer benchmarking and market heuristics rather than structural logic. This paper proposes a new mathematical framework for determining the CEO-to-Employee Pay Ratio ($R_{ceo}$) based on the internal architecture of the corporation. By integrating the Pareto Principle with organizational hierarchy theory, we derive a scalable model that calculates executive impact as a function of the company's size, span of control, and number of management levels.

Our results demonstrate that a scientifically grounded approach can justify executive compensation across a wide range of organization sizes—from startups to multinational firms—while providing a defensible upper bound that aligns with organizational productivity. Comparison with empirical data from the Bureau of Labor Statistics (BLS) suggests that this model provides a robust baseline for boards of directors and regulatory bodies seeking transparent and equitable compensation standards.

________________________________________
1. Introduction

The compensation of Chief Executive Officers (CEOs) has evolved from a matter of private contract into a significant issue of public policy and corporate ethics. Over the past four decades, the ratio of CEO-to-typical-worker pay has swelled from approximately 20-to-1 in 1965 to over 300-to-1 in recent years ${}^1$.

Developing a "fair" compensation model is not merely a question of capping wealth, but of aligning the interests of the executive with those of the shareholders, employees, and the broader society. As management legend Peter Drucker famously noted:
"I have over the years come to the conclusion that (a ratio) of 20-to-1 is the limit beyond which it is very difficult to maintain employee morale and a sense of common purpose." ${}^2$

________________________________________
2. Overview of Existing Works and Theories

The academic literature on CEO compensation generally falls into three primary schools of thought: Agency Theory ${}^3$, Managerial Power Hypothesis ${}^4$, and Social Comparison Theory ${}^5$. While these provide qualitative insights, they often lack a predictive mathematical engine that accounts for the physical size and complexity of the firm.

________________________________________
3. Principles and Assumptions

We propose a framework for estimating the CEO-to-Employee Pay Ratio ($R_{ceo}$) based on five realistic and verifiable assumptions:

Assumption 1: The Pareto Principle. We utilize the 80/20 rule, assuming that the top 20% of a leadership hierarchy is responsible for 80% of strategic results ${}^6$.

Assumption 2: Span of Control. The model incorporates the total number of employees ($N$), hierarchical levels ($K$), and the average number of direct reports ($D$), benchmarked at $D=10$ ${}^7$.

Assumption 3: Productivity Benchmarking. The average worker's productivity ($P$) is set to 1 to establish a baseline for relative scaling.

Assumption 4: Hierarchical Scaling. Strategic impact increases as one moves up the organizational levels, but at a decaying rate of intensity ($H$).

Assumption 5: Occam’s Razor. We prioritize the simplest mathematical explanation that fits the observed wage data ${}^8$.

________________________________________
4. The CEO-to-Employee Pay Ratio ($R_{ceo}$)

The fair compensation of a CEO ($S_{ceo}$) is expressed as:Where $S$ is the average worker's salary. For an organization with $K$ hierarchical levels, we calculate the number of levels as:The total CEO productivity ratio is then modeled as a geometric progression of impact:

________________________________________
5. Model Discussion

To validate the model, we compared our theoretical $R_{ceo}$ against Bureau of Labor Statistics (BLS) data groups ${}^9$.

The current statistics: Ranges for employee salaries (S1, S2), CEO Compensation (CEO1, CEO2), and CEO-to-Employee Pay Ratios (R:1) (R1, R2) are presented in the table below.

Using values of $D=10$ and $H=0.7$, the model tracks the reported ratios of mid-to-large cap companies with high accuracy.

Notes: This table compares empirical (reported) CEO-to-employee pay ratios from large public firms against modeled estimates (Model Rceo), which adjust for factors like company size, industry, and equity components. Data is illustrative based on 2024–2025 benchmarks; actual ratios vary widely.

Figure 1. "CEO Payment Model vs Data" illustrates the comparison.

Special cases like Tesla (2024) demonstrate that while traditional hierarchy explains baseline pay, performance-based stock options can create extreme outliers reaching ratios of 40,000:1 ${}^{10}$.

________________________________________
6. Conclusion

This paper has introduced a consistent and scientifically grounded framework for determining CEO compensation. By shifting the focus from "market guessing" to hierarchical productivity scaling, we provide a transparent justification for executive pay. As an additional feature, the upper bounds of managerial remuneration at all hierarchical levels can be identified across corporations of any size.

The strength of this model is its mathematical consistency across all scales of enterprise. While determining the exact hierarchical decay constant ($H$) remains an area for further empirical refinement, the framework itself provides a logical and defensible constraint on executive compensation, ensuring alignment between leadership rewards and structural organizational impact.

________________________________________
7. References

1. Mishel, L. and Kandra, J. (2021). "CEO pay has skyrocketed 1,322% since 1978," EPI.
2. Drucker, P. F. (1984). "The Changed World Economy," Foreign Affairs.
3. Jensen, M. C. and Meckling, W. H. (1976). "Theory of the firm," J. Finan. Econ.
4. Bebchuk, L. A. and Fried, J. M. (2004). Pay Without Performance. Harvard University Press.
5. Adams, J. S. (1963). "Towards an understanding of inequity," J. Abnorm. Soc. Psych.
6. Koch, R. (1998). The 80/20 Principle. Currency.
7. Gurbuz, S. (2021). "Span of Control," Palgrave Encyclopedia.
8. Baker, A. (2007). "Occam's Razor," Stanford Encyclopedia.
9. BLS (2024). "Occupational Employment and Wage Statistics," U.S. Dept of Labor.
10. Hull, B. (2024). "Tesla’s Musk pay package analysis," Reuters.
________________________________________

Welcome to my home page!